1.Which of the following statements is FALSE?
A.In loop control, initialization and modification steps must lead to the appropriate termination condition.
B.The insertion sort algorithm becomes more efficient as the size of the list increases.
C.The binary search algorithm becomes more efficient as the size of the list increases.
D.Whereas a loop involves repeating a set of instructions in a manner in which the set is completed and then repeated, recursion involves repeating the set of instructions as a subtask of itself.
2.Given the sorted list: Alice, Byron, Carol, Duane, Elaine, Floyd, Gene, Henry, Iris
Which search algorithm will find the name Gene more quickly?
Which search algorithm will find the name Alice more quickly?
Which search algorithm will detect the absence of the name Bruce more quickly?
Which search algorithm will detect the absence of the name Sue more quickly?
A.sequential
B.binary
3.At most, how many entries in a list of 100 names will be interrogated when using the binary search algorithm?
4.Given the sorted list: Alice, Byron, Carol, Duane, Elaine, Floyd, Gene, Henry, Iris
Which search algorithm will find the name Gene more quickly?
Which search algorithm will find the name Alice more quickly?
Which search algorithm will detect the absence of the name Bruce more quickly?
Which search algorithm will detect the absence of the name Sue more quickly?
A. sequential
B. binary
5.Match the definitions on the left with the terms on the right.
repeating a set of instructions as a subtask of itself (one is performed within the other)
a type of loop that tests for termination after the body is executed; often referred to as a "posttest loop"
a type of loop that tests for termination before the body is executed; often referred to as a "pretest loop"
repeating a set of instructions in which the set is completed and then repeated (one after the other)
an algorithm that is useful for searching large sorted lists by using a divide-by-two approach
an algorithm that is useful for searching small lists but is not efficient for large lists
A. while loop
B. sequential search
C. repeat loop
D. iteration
E. recursion
F. binary search
6.At most, how many entries in a list of 500 names will be interrogated when using the binary search algorithm?