Remaining time: $25$:$23$

Question $14$

Which of the following option is not correct?

Your answer:

Both $(x)$ and $($Z$)$

$($X$)$ If the queue is implemented with a linked list, keeping track of a front pointer, Only rear pointer s will change during an insertion into an non$-$empty queue.

$($Z$)$ Queue data structure can be used to implement Quick short algorithm but not least recently used $($LRU$)$ page fault algorithm.

$($Y$)$ Queue data structure can be used to implement least recently used $($LRU$)$ page fault algorithm and Quick short algorithm.

Clear answer