Data Structure
Java
Python
HTML
Interview Preparation
- Interview Prep
- Tutorials
- Tracks
GATE | GATE CS Mock 2018 | Set 2 | Question 30
Last Updated :
Discuss
Comments
Which of the following option is not correct?
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.
Queue data structure can be used to implement Quick short algorithm but not least recently used (LRU) page fault algorithm.
Both (A) and (C)
This question is part of this quiz :
Top MCQs on Queue Data Structure with Answers,GATE CS Mock 2018 | Set 2,Top 50 Data Structures MCQs with AnswersShare your thoughts in the comments
GeeksforGeeks