Answer Happy

1) Binary search trees (BSTs) and B-Trees were both discussed.
Under what circumstances would you recommend each be
used? Select All Applied
A. BSTs used when O(lg n) search is required
and the tree fits into memory
B. B-Trees are used when O(lg n) search is
required and the tree fits into memory
C. A BST is a common data structure used to
implement a priority queue
D. B-Trees are used when O(lg n) or faster
search is required and the tree does not fit into
memory
E. All of the above
F. None of the above
2) What factor determines the size of the nodes in a B Tree? Select
All applied
A. The total number of records to be
stored
B. The requirement for O(lg n) or faster
search
C. The size of the external record block that
can be read in using one read operation
D. The need to implement a stack whose records
can all fit into a single node
E. All of the above
F. None of the above
3) Why is it important to keep a binary search tree (BST) close
to being in balance ( e.g., an AVL tree)? Select All applied
A. The requirement to use as little memory as
possible
B. The need to use the BST to implement a
queue
C. Avoiding allowing the tree to become
degenerate
D. The requirement for O(lg n)
search
E. All of the above
F. None of the above