Question

Which of the following option is not correct?
(A) If the queue is implemented with a linked list, keeping track of a
front pointer, Only rear pointers will change during an insertion Into
an non-empty queue.
(B) Queue data structure can be used to implement least recently
used (LRU) page fault algorithm and Quick short algorithm.
(C) Queue data structure can be used to implement Quick short
algorithm but not least recently used (LRU) page fault algorithm.
(D) Both (A) and (C)​

Answer 1

Answer:

it's a little bit complicative