B.E 3rd
SEM CSE Department
DATA STRUCTURE (2130702)
Assignment:-2
Queue:
1) State the
difference between LIFO and FIFO.
2) Discuss
representation of Queue and operations on Queue.
3) Write an algorithm to insert an
element into and delete an element from singly queue.
4) What is the
drawback of the simple queue? How can we overcome it? (State the advantages of
circular queue over normal queue.)
5) Write an
algorithm to insert an element into and delete an element from circular queue.
6) Define following terms:
a. Priority
Queue
b. Dequeue
7) What is the
difference between simple queue, circular queue, double ended queue (dequeue)
and priority queue?
8) Discuss applications of queue
with example.
No comments:
Post a Comment