Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
15 Cards in this Set
- Front
- Back
|
1. Which of the following is a LIFO structure? A. Array B. Stack C. Queue D. Tree |
B. Stack. |
|
|
2. Which of the following is a FIFO structure?
A. Array B. Stack C. Queue D. Tree |
C. Queue. |
|
|
3. Which of the following is static in the sense that it does not change size or shape as information is stored and retrieved? A. Array B. Stack C. Queue D. Tree |
A. Array. |
|
|
4. Suppose you were going to retrieve items of data that you would later need to process in the opposite order from that in which they were retrieved. Which of the following would be the best structure in which to store the items? A. Traditional linked list B. Stack C. Queue D. Tree |
B. Stack. |
|
|
5. Suppose a binary tree contained the nodes W, X, Y, and Z. If W and X were children of Y, and Z had no children, which node would be the root? A. W B. X C. Y D. Z |
C. Y. |
|
|
6. Suppose a binary tree contained the nodes W, X, Y, and Z, and each node had at most one childHow many terminal nodes would be in the tree? A. One B. Two C. Three D. Undetermined |
A. One. |
|
|
7. If the two-dimensional array X were stored in row-major order, then in the block of main memory containing X, which of the following would be true? A. The entry X[1,2] would appear before X[2,1]. B. The entry X[1,2] would appear after X[2,1]. C. The entry X[1,2] would be in the same location as X[2,1]. D. None of the above |
A. The entry X[1,2] would appear before X[2,1]. |
|
|
8. Which of the following is not used when determining the location of an entry in a two-dimensional homogeneous array stored in row-major order? A. Indices B. Number of rows in the array C. Address polynomial D. Number of columns in the array |
B. Number of rows in the array. |
|
|
9. Which of the following is not a means of locating an entry in a linked storage structure? A. Head pointer B. Child pointer C. Root pointer D. NIL pointer |
D. NIL Pointer. |
|
|
10. If a stack contained the entries w, x, y, z (from top to bottom), which of the following would be the contents after two entries were removed and the entry r was inserted? A. w, x, r B. y, z, r C. r, y, z D. r, w, x |
C. r, y, z. |
|
|
11. If a queue contained the entries w, x, y, z (from head to tail), which of the following would be the contents after two entries were removed and the entry r was inserted? A. w, x, r B. y, z, r C. r, y, z D. r, w, x |
B. y, z, r. |
|
|
12. If the number of nodes in a binary tree is 2^n (where n is a positive integer), then the entire tree would contain at least A. 2^n + 1 nodes B. 2^(2n) nodes C. 2^(n+1) - 1 nodes D. 2^(n+2) nodes |
C. 2^(n+1) - 1 nodes. |
|
|
13. If the longest path in a binary tree contained exactly four nodes, what is the maximum number of nodes that could be in the entire tree?
A. 4 B. 7 C. 15 D. 31 |
C. 15. |
|
|
C. A / \ C B |
|
|
B. C / \ A B |
