Queue Operations :: Discussion


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
Answer:  Option  A
Explanation:

Linear list of elements in which deletion is done at front side and insertion at rear side is called Queue. In stack we will delete the last entered element first.

Tutorial Link:
Published by:

Comments are not available


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