Skip to content
Related Articles

Related Articles

GATE | GATE CS Mock 2018 | Set 2 | Question 30
  • Last Updated : 08 Mar, 2018

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

My Personal Notes arrow_drop_up
Recommended Articles
Page :