Queue Operations - Section 4 Multiple Questions and Answers.




6.A normal queue, if implemented using an array of size MAX_SIZE, gets full when?
A. Rear = MAX_SIZE – 1
B. Front = (rear + 1)mod MAX_SIZE
C. Front = rear + 1
D. Rear = front

7.Queues serve major role in?
A. Simulation of recursion
B. Simulation of arbitrary linked list
C. Simulation of limited resource allocation
D. Simulation of heap sort

8.Which of the following is not the type of queue?
A. Ordinary queue
B. Single ended queue
C. Circular queue
D. Priority queue

9.In cae of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.
A. AVAIL
B. FRONT
C. REAR
D. NULL

10.In which data structure element is inserted at one end called Rear and deleted at other end called Front:
A. Queue
B. Stack
C. Both
D. Binary type

«»



Quick Links

GAT Subject



   Computer Science    English Mcqs    Agriculture    

Engineering



   Computer Science    Civil Engineering    

Technical



   Networking    Electronics    Database    

Past Papers



   Model Papers    FPSC Papers