1. Which of the following data structures falls under the category of a 'dictionary'? Tree Linked list Hash Hash table

2. When using a hash, which function will give you the parent of the entry with index i? Integer division, i / 2 Multiplication, i * 2 Decimal division, i / 2 Multiplication, i * 2 + 1

3. A vector (an indexed, growable list) would most likely be implemented on top of which of these structures? Hash table Stack Tree Linked list

4. If you have a empty stack that can contain letters, and you push (in order) these letters onto it, what order will they be in when you pop them off? 't' 'a' 'p' 't' 'a' 'p' 'p' 'a' 't' 'a' 'p' 't' There is no way to tell

5. If you have a empty queue that can contain letters, and you enqueue (in order) these letters into it, what order will they be in when you dequeue them? 'm' 'a' 'r' 'r' 'a' 'm' 'm' 'a' 'r' 'a' 'r' 'm' There is no way to tell

6. Which of the following could best be described by the graph structure? Given a word, finding its definition Algebraic problems Roads connecting cities A GUI (Graphical User Interface)

7. If you have a sorted, balanced binary tree with 15 elements in it, how many steps, maximum, will it take you to decide whether an element is present in the tree? Three Four Fifteen Depends on the computer

8. If you wanted to make sure that the close-parenthesis (the ')' characters) match the open-parenthesis (the '(' characters) in a mathematical expression, which data structure could help you? Stack Tree Queue Hash table

9. Which of these is true about a set? All of these The elements are kept in order There are no duplicates They can only hold numbers

10. Modern filesystems, like ReiserFS and XFS, use which structure to organize their data for efficient access? B-Trees Lists Tables B+Trees