Algorithms Test

a general description of a task that can (or cannot) be solved with an algorithm

• exam

• test

• problem

• solution

a finite set of instructions that accomplish a task

• instructions

• algorithm

• iteration

• sequence

As the data set grows in size, linear search becomes more efficient than binary search. 

• True
• False

Which of the following is the best description of the binary search algorithm?

• Put the elements in order, then go through them one by one until target is found or the end of the list is reached.
• Put the elements in order, compare with the middle value, if not the target: continue to the left or right of the middle and repeat. 
• Elements do not need to be in order. Go through them one by one until target is found or the end of the list is reached.
• Elements do not need to be in order, compare with the middle value, if not the target: continue to the left or right of the middle and repeat. 

Which of the following is the best description of the linear search algorithm?

• Put the elements in order, then go through them one by one until target is found or the end of the list is reached.
• Put the elements in order, compare with the middle value, if not the target: continue to the left or right of the middle and repeat. 
• Elements do not need to be in order. Go through them one by one until target is found or the end of the list is reached.
• Elements do not need to be in order, compare with the middle value, if not the target: continue to the left or right of the middle and repeat. 

putting steps in order

• chronologicaling

• chronology

• sequencing

• ordering

deciding which steps to do next

• selection

• iteration

• sequencing

• ordering

doing some steps over and over

• looping

• iteration

• repetition

• selection

a measure of how many steps are needed to complete an algorithm

• sequence

• iteration

• order

• efficiency

Any algorithm whose efficiency includes a number exponent is called

• linear

• polynomial

• binary

• exponential