1 of 53
Term Definition
Which of the following would b
not be a good application for a
binary tree?
a. a family tree
b. a Huffman tree
c. a search tree
d. an expression tree
Give this one a try later!
, True False
Correct definition
a
2 of 53
Term Definition
With recursive binary search c
algorithm, how many items
need to be checked in the list?
a. all items
b. half the items
c. log(n) of the n items
d. none of the items
Give this one a try later!
True False
3 of 53
Term Definition
What makes backtracking b
different from random trial and
error?
a. it is always faster than random
trial and error
,b. it is systematic and won't try
the same path more than once
c. random trail and error cannot
be made in a program
d. there is no real difference
Give this one a try later!
True False
4 of 53
Term Definition
What is the behavior of a stack? c
a. FIFO
b. LILO
c. LIFO
d. none of the above
Give this one a try later!
True False
5 of 53
Term Definition
A priority queue... b
a. is a container
b. is a container adapter that
, uses a specific underlying
container, e.g. vector or deque
c. is implemented with a stack
d. sometimes uses a LIFO to
implement a waiting line
Give this one a try later!
True False
6 of 53
Term Definition
(___) traversal doesn't exist d
a. preorder
b. postorder
c. inorder
d. outorder
Give this one a try later!
True False
7 of 53
Term Definition
Writing "towers of Hanoi" code d
for 64 disks is
a. virtually the same as for 3
Term Definition
Which of the following would b
not be a good application for a
binary tree?
a. a family tree
b. a Huffman tree
c. a search tree
d. an expression tree
Give this one a try later!
, True False
Correct definition
a
2 of 53
Term Definition
With recursive binary search c
algorithm, how many items
need to be checked in the list?
a. all items
b. half the items
c. log(n) of the n items
d. none of the items
Give this one a try later!
True False
3 of 53
Term Definition
What makes backtracking b
different from random trial and
error?
a. it is always faster than random
trial and error
,b. it is systematic and won't try
the same path more than once
c. random trail and error cannot
be made in a program
d. there is no real difference
Give this one a try later!
True False
4 of 53
Term Definition
What is the behavior of a stack? c
a. FIFO
b. LILO
c. LIFO
d. none of the above
Give this one a try later!
True False
5 of 53
Term Definition
A priority queue... b
a. is a container
b. is a container adapter that
, uses a specific underlying
container, e.g. vector or deque
c. is implemented with a stack
d. sometimes uses a LIFO to
implement a waiting line
Give this one a try later!
True False
6 of 53
Term Definition
(___) traversal doesn't exist d
a. preorder
b. postorder
c. inorder
d. outorder
Give this one a try later!
True False
7 of 53
Term Definition
Writing "towers of Hanoi" code d
for 64 disks is
a. virtually the same as for 3
