Scribd
Upload
4 views1 page

Data Structure Assignment 3

The document outlines an assignment focused on data structures, specifically stacks, queues, and linked lists. It includes tasks such as defining a stack ADT, evaluating postfix expressions, converting infix to postfix expressions, and comparing different types of linked lists. Additionally, it covers queue types, priority queues, and provides pseudo Python code for various operations on these data structures.

Uploaded by

Kapil Dere
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
4 views1 page

Data Structure Assignment 3

The document outlines an assignment focused on data structures, specifically stacks, queues, and linked lists. It includes tasks such as defining a stack ADT, evaluating postfix expressions, converting infix to postfix expressions, and comparing different types of linked lists. Additionally, it covers queue types, priority queues, and provides pseudo Python code for various operations on these data structures.

Uploaded by

Kapil Dere
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

Data structures

Assignment no-3
Unit-III
STACK ,QUEUE ,LINKED-LIST

1. What is stack ? Write an ADT for stack.

2. Explain (algo.) evaluation of postfix expression using stack with


example.

3. Write algorithm to convert infix expression to postfix expression.

4. Explain the stepwise conversion using stack for the given infix
expression to the postfix expression :
1) A * B + C * D. 2) A * (B + C) * D. 3) ((a/(b-c+d))*(e-a)*c

5. Compare Singly, Doubly and Circular Linked List..

6. Write pseudo Python code to delete a node from a doubly


linked list.
7. Explain linear queue and circular queue with suitable example. Give
the advantages of circular queue over linear queue.

8. What is Priority queue ? Describe the operations on priority


queue and explain its applications.

9. Explain Dequeue with the insert and delete operations performed on it.

10. Write pseudo Python code to perform insert and delete operation on
linear queue.

You might also like