D684 - Intro to CS (WGU) Section 3 Algorithms
| | | | | | | | |
and Pseudocode exam with correct detailed
| | | | | |
answers
array |- | |correct |answers |a |collection |of |items |stored |at |contiguous |memory |locations; |each |
item |can |be |accessed |using |an |index
binary |search |- | |correct |answers |a |search |algorithm |that |finds |the |position |of |a |target |value |
within |a |sorted |array |by |repeatedly |dividing |the |search |interval |in |half
bubble |sort |- | |correct |answers |a |simple |sorting |algorithm |that |repeatedly |steps |through |a |list, |
compares |adjacent |elements, |and |swaps |them |if |they |are |in |the |wrong |order
concrete |step |- | |correct |answers |a |detailed |action |in |an |algorithm |that |specifies |exactly |how |to
|perform |a |task
count-controlled |loop |- | |correct |answers |a |loop |that |repeats |a |specific |number |of |times; |
controlled |by |a |counter |variable |(e.g., |"for" |loop)
desk |checking |- | |correct |answers |a |manual |method |of |reviewing |the |logic |of |a |program |or |
algorithm |using |a |pencil |and |paper |instead |of |a |computer
event-controlled |loop |- | |correct |answers |a |loop |that |continues |to |execute |until |a |specific |
condition |or |event |occurs, |such |as |user |input |or |a |sensor |reading
heterogeneous |- | |correct |answers |a |term |describing |a |collection |of |items |that |are |of |different |
types
, homogenous |- | |correct |answers |a |term |describing |a |collection |of |items |that |are |all |of |the |
same |type
index |- | |correct |answers |a |numerical |representation |of |an |element's |position |within |an |array |
or |list
insertion |sort |- | |correct |answers |a |sorting |algorithm |that |builds |the |final |sorted |array |one |item
|at |a |time |by |inserting |each |new |item |into |its |correct |position
processing |- | |correct |answers |the |act |of |performing |operations |on |data |according |to |a |set |of |
instructions |to |achieve |a |desired |result
record |- | |correct |answers |a |composite |variable |that |can |store |multiple |fields |of |different |data |
types, |usually |related |to |a |single |entity
searching |- | |correct |answers |the |process |of |finding |a |specific |item |or |value |within |a |collection |
of |data
selection |sort |- | |correct |answers |a |simple |sorting |algorithm |that |repeatedly |finds |the |minimum
|element |from |the |unsorted |part |of |a |list |and |moves |it |to |the |beginning
sequential |search |(linear |search) |- | |correct |answers |a |search |algorithm |that |checks |each |
element |in |a |list |one |by |one |until |the |desired |element |is |found |or |the |list |ends
sorting |- | |correct |answers |the |process |of |arranging |data |in |a |particular |order, |such |as |
ascending |or |descending
| | | | | | | | |
and Pseudocode exam with correct detailed
| | | | | |
answers
array |- | |correct |answers |a |collection |of |items |stored |at |contiguous |memory |locations; |each |
item |can |be |accessed |using |an |index
binary |search |- | |correct |answers |a |search |algorithm |that |finds |the |position |of |a |target |value |
within |a |sorted |array |by |repeatedly |dividing |the |search |interval |in |half
bubble |sort |- | |correct |answers |a |simple |sorting |algorithm |that |repeatedly |steps |through |a |list, |
compares |adjacent |elements, |and |swaps |them |if |they |are |in |the |wrong |order
concrete |step |- | |correct |answers |a |detailed |action |in |an |algorithm |that |specifies |exactly |how |to
|perform |a |task
count-controlled |loop |- | |correct |answers |a |loop |that |repeats |a |specific |number |of |times; |
controlled |by |a |counter |variable |(e.g., |"for" |loop)
desk |checking |- | |correct |answers |a |manual |method |of |reviewing |the |logic |of |a |program |or |
algorithm |using |a |pencil |and |paper |instead |of |a |computer
event-controlled |loop |- | |correct |answers |a |loop |that |continues |to |execute |until |a |specific |
condition |or |event |occurs, |such |as |user |input |or |a |sensor |reading
heterogeneous |- | |correct |answers |a |term |describing |a |collection |of |items |that |are |of |different |
types
, homogenous |- | |correct |answers |a |term |describing |a |collection |of |items |that |are |all |of |the |
same |type
index |- | |correct |answers |a |numerical |representation |of |an |element's |position |within |an |array |
or |list
insertion |sort |- | |correct |answers |a |sorting |algorithm |that |builds |the |final |sorted |array |one |item
|at |a |time |by |inserting |each |new |item |into |its |correct |position
processing |- | |correct |answers |the |act |of |performing |operations |on |data |according |to |a |set |of |
instructions |to |achieve |a |desired |result
record |- | |correct |answers |a |composite |variable |that |can |store |multiple |fields |of |different |data |
types, |usually |related |to |a |single |entity
searching |- | |correct |answers |the |process |of |finding |a |specific |item |or |value |within |a |collection |
of |data
selection |sort |- | |correct |answers |a |simple |sorting |algorithm |that |repeatedly |finds |the |minimum
|element |from |the |unsorted |part |of |a |list |and |moves |it |to |the |beginning
sequential |search |(linear |search) |- | |correct |answers |a |search |algorithm |that |checks |each |
element |in |a |list |one |by |one |until |the |desired |element |is |found |or |the |list |ends
sorting |- | |correct |answers |the |process |of |arranging |data |in |a |particular |order, |such |as |
ascending |or |descending
