Questions On Queues- Data Structure Sem: II

Laxmi Institute of Computer Applications (MCA)
Subject: 620001 – Data Structure Sem: II
Question set - II Academic Year: 2010 - 2011
By : ManjoorHussain Kapoor 1

Q1) Write an algorithm to add a new element of information to a circular queue?

Q2) Write algorithms for inserting and deleting items from a DEQUE?

Q3) Distinguish between Queues and Deques?

Q4) Describe a circular DEQUEUE? Write algorithms for insertion into front end and deletion
from the back end of this structure?

Q5) Explain the implementation of circular queue using array. How an “empty queue” is distinguished
from a “full queue”? Write necessary functions to perform all valid operations on circular queue.

Q6) Discuss the advantages of Circular queue with example.

Q7) What are the various queue operations? Explain.

Q8) What are dequeues ? Explain various representations of dequeues.

Q9) What are the difference between a stack and a queue?

Q10) Write the insertion and deletion procedures in a queue.

Q11) Mention and explain various types of queues. Compare them.

Q12) What is meant by circular queue and deque ?

Q13) What is meant by priority queue?