Queue Operations Multiple Questions and Answers.




11.Which data structure is used in breadth first search of a graph to hold nodes?
A. Stack
B. Queue
C. Array
D. Tree

12.In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively:
A. 0 and 1
B. 0 and -1
C. -1 and 0
D. 1 and 0

13.In a circular queue the value of r will be:
A. r=r+1
B. r=(r+1)% [QUEUE_SIZE – 1]
C. r=(r+1)% QUEUE_SIZE
D. r=(r-1)% QUEUE_SIZE

14.………… is not the operation that can be performed on queue:
A. Insertion
B. Deletion
C. Retrieval
D. Traversal

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

«»



Quick Links

GAT Subject



   Computer Science    English    Agriculture    Botany    

Engineering



   Computer Science    Civil Engineering    

Technical



   Networking    Electronics    Database    

Past Papers



   Model Papers    FPSC    PPSC    NTS