DS - UNIT-4 QUESTIONS

UNIT-4: TWO MARKS QUESTIONS

Q. no	Question Description
1	List the difference between stack and queue.
2	What are the properties of queue?
3	What is FIFO? How is it related to queues?
4	What is scheduling?
5	What is output restricted Dequeue list its operations.
6	List the applications of queues.
7	Mention the drawback of implementing queues using arrays.
8	What is a circular queue?
9	Write any two real-world examples where queues are used.
10	What is the difference between a queue and a deque?
11	List any two types of deques.

UNIT-4: FIVE MARKS QUESTIONS

Q. no	Question Description
1	Define Queue ADT. Explain basic operations of a Queue ADT.
2	What are the basic operations in a queue? Explain them.
3	Assume the Queue is empty. Apply the queue operations in the given order and display the queue contents after each operation. Enqueue(15), Enqueue(25), Enqueue(35), Dequeue(), Enqueue(40), Dequeue(), Dequeue(), Enqueue(55), Enqueue(65), Enqueue(75), Dequeue().
4	Is the Queue subjected to underflow condition? If yes, at what order in the above-mentioned order it is occurred?
5	Write a C program to implement Queue operations using linked list.
6	Write a program for implementing Queue with arrays.
7	Compare and contrast the Queue and Circular Queue and implement enqueue and dequeue operations.
8	Discuss the advantages of Circular queue over Linear queue. Explain different operations performed on circular queue with suitable diagrams.
9	Explain the implementation of Circular Queue operations using arrays.
10	What is DEQUE? Explain different operations in DEQUE with memory representations.
11	With the help of code or pseudocode, explain how to implement a deque using arrays.
12	List and explain different applications of queue.
13	Discuss the use of queues in CPU and disk scheduling. Provide examples of queue-based scheduling algorithms.
14	Explain how queues are used in Breadth-First Search (BFS) algorithm with a suitable example.