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 pointer s 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: (C)
Explanation:
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. Queue data structure can be used to implement least recently used (LRU) page fault algorithm and Quick short algorithm. Only option (C) is not correct.
Quiz of this Question
Please comment below if you find anything wrong in the above post