Scribd
Upload
17 views2 pages

Chapter 5

Uploaded by

vaishnavidhuttarge26
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views2 pages

Chapter 5

Uploaded by

vaishnavidhuttarge26
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CHAPTER 5

1. Describe the queue as abstract data type.


2. Define circular queue. Explain insertion and deletion operation on circular queue.
3. Describe priority queue with suitable example.
4. Write a procedure for inserting and element in a queue
5. Describe priority queue with example.
6. Explain the concept of circular queue.
7. Explain queue as an abstract data type, also give applications of queue
8. Explain the concept of double ended queue
9. Write a menu driven program to insert, delete an element in a queue and display the queue
10. ) Draw and explain circular queue.
11. Distinguish between stack and queue with minimum 4 points.
12. Describe priority queue and list its advantages.
13. Write a procedure to insert an element into a queue and to delete an element from a queue.
14. Define the terms FRONT and REAR of queue. Enlist any four operations of queue.
15. Write a ‘C’ program to implement a queue with insert and delete operation.
16. Describe how queue works as an abstract data type.
17. Write the procedure for inserting and deleting an element from queue.

18.
19.

20.

21.
22. Describe circular queue. Give its advantage.
23. What is priority queue ? Describe working of priority queue with suitable example
24. Write a code delete an element in queue.
25. Write a code delete an element in queue.
26. Sketch representation of queue as an array.
27. Describe priority queue with its advantages.
28. Compare circular queue and double-ended queue. (Min. 4 points)
29. Write a program for insert and delete operation perform on queue. State any two application
of queue.
30. Define following terms : 1) Priority Queue 2) Dequeues 3) Queue as an Abstract Data Type 4)
Empty Queue.
31. Write a ‘C’ program to insert an element in a queue.
32. Define circular queue. Also describe advantage of circular queue over linear queue.
33. Describe working of dequeue with suitable example
34. Explain ‘Queue Full’ and ‘Queue Empty’ condition with suitable example.
35. Write any four applications of Queue.
36. Define queue. Write an algorithm to delete an element from a queue.
37. Enlist queue operations condition.
38. Draw and explain construction of circular queue.
39. Draw the diagram of circular queue with front and rear pointers.
40. Explain Queue overflow and underflow conditions with examples.
41. Define queue. State any two applications where queue is used.
42. Explain the concept of circular Queue along with its need.
43. Implement a ‘C’ program to insert element into the queue and delete the element from the
queue.
44. List any 4 applications of queue.
45. Describe queue full and queue empty operation conditions on linear queue with suitable
diagrams.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy