[Solved] Which of the following option is not correct?

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.

2k

0

Do you find this helpful?

6

View all MCQs in

Data Structures (DS)

Discussion

No comments yet

Related MCQs

Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
Which of the following is a correct way to declare a multidimensional array in Java?
Which of the following statements for a simple graph is correct?
How many of the following statements are correct?
Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
Which of the following is not the part of ADT description?
Which of the following is not the internal sort?
Which of the following is not the type of queue?
Which of the following data structure is not linear data structure?
Which of the following statement is true? i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.