admonitionTest08(选择题)

2021年1月20日发(作者：aged)
Test Bank
—
Chapter Eight (Data Abstractions)


Multiple Choice Questions


1. Which of the following is a LIFO structure?



ANSWER:

B

2. Which of the following is a FIFO structure?



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?



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?



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?



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?



ANSWER:

A

A. One

B. Two

C. Three
D. Undetermined

A. W

B. X
C. Y
D. Z
A. Traditional linked list

B. Stack

C. Queue
D. Tree
A. Array
B. Stack

C. Queue
D. Tree
A. Array
B. Stack

C. Queue
D. Tree
A. Array
B. Stack

C. Queue
D. Tree

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?






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?




ANSWER:

B

9. Which of the following is not a means of locating an entry in a linked storage structure?



ANSWER:

D

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?



ANSWER:

C

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?



ANSWER:

B

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
2
n
nodes
C. 2
n
+ 1
- 1 nodes

D. 2
n
+ 2
nodes
A.
w
,
x
,
r

B.
y
,
z
,
r


C.
r
,
y
,
z


D.
r
,
w
,
x

A.
w
,
x
,
r

B.
y
,
z
,
r


C.
r
,
y
,
z


D.
r
,
w
,
x

A. Head pointer
B. Child pointer
C. Root pointer
D
. NIL pointer
A. Indices

B. Number of rows in the array

D. Number of columns in the array

C. Address polynomial
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:

C

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?




ANSWER:

C

14. The nodes in which of the trees below will be printed in alphabetical order by the following
recursive procedure?






procedure printTree (Tree)
if (Tree is not empty)
then (print the root node;
apply the procedure printTree to the right subtree of Tree;

apply the procedure printTree to the left subtree of Tree)

A. 4

B. 7

C. 15

D. 31



A.



B.


C.



















ANSWER:

C

15. The nodes in which of the trees below will be printed in alphabetical order by the following
recursive procedure?





procedure printTree (Tree)
if (Tree is not empty)
then (apply the procedure printTree to the left subtree of Tree;

apply the procedure printTree to the right subtree of Tree;

print the root node)




A.



B.


C.



















ANSWER:

B