Multiple Choice
When implementing a queue as a singly-linked list, which of these statements is correct?
A) For better efficiency, nodes should be added at the back and removed at the front.
B) For better efficiency, nodes should be added at the front and removed at the back.
C) There is no difference in efficiency whether nodes are added at the front and removed at the back, or added at the back and removed at the front.
D) You cannot effectively implement a queue as a singly-linked list.
Correct Answer:

Verified
Correct Answer:
Verified
Q10: Which of the following operations is least
Q11: Which of the following actions must be
Q14: Suppose we maintain an array A of
Q16: A stack can be implemented as a
Q17: Given the partial LinkedList and LinkedListIterator class
Q19: Consider the following code snippet: LinkedList<String> words
Q38: Using the textbook's implementation of a linked
Q48: Elements in a hash table are said
Q81: Using the textbook's implementation of a linked
Q94: Which of the following statements about hash