Answer the following statements true (T) or false (F)
1) In a linked list implementation of a queue, the dequeue operation is more efficient if it removes elements from the front of
the linked list than if it removes elements from the rear of the linked list.
2) In a linked list implementation of a queue, the enqueue operation compares the element to be added against the existing
elements in the queue to determine the correct place to insert it.
3) The dequeue operation should throw an exception if it removes the last element in the queue.
4) In a circular array implementation of a queue, the front and rear references can change so that the value in front is greater
than the value in rear.
5) In a circular array implementation of a queue, the remainder operator (%) can be used to calculate the value of the rear
reference in an enqueue operation.
1) T
2) F
3) T
4) T
5) T
You might also like to view...
The number of positive integers less than n and relatively prime to n is referred to as __________ function.
Fill in the blank(s) with the appropriate word(s).
Which keyword is used to specify that a class will define the methods of an interface?
a. uses b. implements c. defines d. extends
The mouse pointer may appear as a(n) ________ during the time you are waiting for a computer to boot
A) hour glass B) four-headed arrow C) rotating circle D) double-arrow
As you multitask, you will invariably need to move and resize windows so that you can see more of one window or view two or more windows at the same time.
Answer the following statement true (T) or false (F)