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...
Adding the minimum value and the maximum value together provides the range in a data set
Indicate whether the statement is true or false
Visual C# apps can have multiple threads of execution, where each thread has its own ________ stack, allowing it to execute concurrently with other threads while sharing with them application-wide resources such as memory and processors. This capability is called multithreading.
a) method-call b) attribute c) memory d) application