Scribd
Upload
10 views

DSA Assignment 2

The document outlines an assignment for a Data Structure and Algorithms course, detailing various questions related to stacks, queues, and their implementations in C. It includes topics such as static and dynamic stacks, infix to postfix conversion, circular queues, and priority queues. The assignment is due on 12/11/2024 and specifies submission guidelines.

Uploaded by

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

DSA Assignment 2

The document outlines an assignment for a Data Structure and Algorithms course, detailing various questions related to stacks, queues, and their implementations in C. It includes topics such as static and dynamic stacks, infix to postfix conversion, circular queues, and priority queues. The assignment is due on 12/11/2024 and specifies submission guidelines.

Uploaded by

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

Assignment-2

Subject Name- Data Structure and Algorithms Subject Code: PCCCS301


Submission Date: 12/11/2024

Question 1: What is a stack? Write a C code for implementation of static and dynamic stack and
discuss the merits and demerits of static and dynamic stack.
Question 2: Discuss the classification of stack. What are the operations involved in stack? write
a algorithms and code for each operation.
Question 3: Explain the following term:
a. Application of stack in Computers
b. Infix expression
c. Polish Notion
d. Reverse Polish Notation
e. Multiple Stack
Question 4: Write an algorithms and program to convert expression from infix to post fix.
Convert X: A+(B*C-(D/E-F) *G)*H into post fix form showing stack status after every step in
tabular form.
Question 5: Write an algorithms and program to convert expression from infix to prefix.
Convert expression A+(B+C+D+E)+F/G in prefix expression.
Question 5: Discuss the Queue in brief. Write C code for implementation of static and dynamic
Queue.
Question 6 (a): Write down the algorithm and code for addition and deletion of element from
static queue.
Question 6 (b): Discuss the limitation of static queue. Discuss the difference between static and
dynamic queue.
Question 7: What is a Circular Queue? Write an algorithm for insertion and deletion of node in
Queue.
Question 8: Define double ended queue. Discuss the different types of double ended queue.
Write algorithms for:
a. Insertion of an element at the rear end of the queue
b. Deletion of an element from the front end of the queue
c. Insertion of an element at the front end of the queue.
d. Deletion of an element from the Rear end of the queue.
e. Function to display the contents of a queue.
Question 9: What is priority queues? Discuss the application of priority queues.
Question 10: What do you understand by Multiple queue and deque? what is the need for
deque?

Note:
1. No submission will be accepted after 12/11/2024.
2. All the submission should be written in A4 Sheet only.
3. All the question should be written in sequence.

You might also like