Queue Operations - Section 4 Multiple Questions and Answers.

1.A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?
A. Queue
B. Stack
C. Tree
D. Linked list

2.The data structure required for Breadth First Traversal on a graph is?
A. Stack
B. Array
C. Queue
D. Tree

3.A queue follows?
A. FIFO (First In First Out) principle
B. LIFO (Last In First Out) principle
C. Ordered array
D. Linear tree

4.Circular Queue is also known as?
A. Ring Buffer
B. Square Buffer
C. Rectangle Buffer
D. Curve Buffer

5.A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
A. Queue
B. Circular queue
C. Dequeue
D. Priority queue


Quick Links

GAT Subject

   Computer Science    English    Agriculture    Botany    


   Computer Science    Civil Engineering    


   Networking    Electronics    Database    

Past Papers

   Model Papers    FPSC    PPSC    NTS