Test08(选择题)..doc

Test Bank—Chapter Eight (Data Abstractions) Multiple Choice Questions 1. Which of the following is a LIFO structure? A. Array B. Stack C. Queue D. Tree ANSWER: B 2. Which of the following is a FIFO structure? A. Array B. Stack C. Queue D. Tree ANSWER: C 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 ANSWER: A 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 ANSWER: B 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 ANSWER: C 6. Suppose a binary tree contained the nodes W, X, Y, and Z, and each node had at most one child. How many terminal nodes would be in the tree? A. One B. Two C. Three D. Undetermined ANSWER: A 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 ANSWER: A 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 ANSWER: B 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 ANSWER: D 10. If a stack contained the entries w, x, y, z (from top to b