McqMate
Q. |
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. queue data structure can be used to implement quick short algorithm but not least recently used (lru) page fault algorithm. |
View all MCQs in
Data Structures (DS)No comments yet