CS 303L Data Structure and Algorithm
April 10, 2008
Homework 7
(Due on April 24, 2008)
Please print this two-page assignment and write your answer in the
blank in front of each question.
1. The maximum number of elements that must be examined to complete a binary search in
an array of 200 elements is
a. 200
b. 8
c. 1
d. 13
2. In the insertion sort, after an item is inserted in the partially sorted group, it will
a. Never be moved again.
b. Never be shifted to the left.
c. Often be moved out of this group.
d. Find that its group is steadily shrinking.
3. Suppose you insert 15, 25, 35, and 45 into a queue. Then you remove three items. Which
one is left?
a. 15
b. 25
c. 35
d. 45
4. When you create a reference to a link in a lined list, it
a. Must refer to the first link
b. Must refer to the link pointed to “current node”
c. Must refer to the link pointed to “next node”
d. Can refer to any link you want
