Scribd
Upload
16 views4 pages

UNIT-III-Question Bank

Uploaded by

Anushka kolte
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
16 views4 pages

UNIT-III-Question Bank

Uploaded by

Anushka kolte
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/ 4

JSPM’s

Jayawantrao Sawant College of Engineering, Hadapsar,Pune


Department of Information Technology
Class – SE (IT)
Question Bank –Data Structure and Algorithms

Unit-III- Stack & Queue

Q. No. Question Description Marks CO PSO PO CL


1. What is recursion? Explain role of stack 3 3 PSO1 PO1, 2

in recursion. PO2
2. Write a C++ code for stack as an ADT. 4 3 PSO1 PO1, 2

PO2,
PO3
3. Explain any three applications of stack with 4 3 PSO1 PO1, 2

appropriate example. PO2


4. Explain/Write stack as an Abstract Data 2 3 PSO1 PO1 2

Type (ADT).
5. Write a pseudo C++ code for the 4 3 PSO1 PO1, 2

following stack operations: PO2,


1. Push operation PO3
2. Pop operation
6. Explain stack and write pseudo C++ 6 3 PSO1 PO1, 2

algorithm for PUSH and POP operations PO2,


of stack. PO3
7. Explain the following Linear Data Structures: 3 3 PSO1 PO1 2

Stack and Queue.


8. Write a short note on- 5 3 PSO1 PO1 2

i. Priority Queue
ii. Double Ended Queue
9. Write a C++ code for implementation of stack 6 3 PSO1 PO1, 2

as an ADT using linked organization. PO2,


PO3
10. Explain/Write Queue as an Abstract Data 2 3 PSO1 PO1 2

Type (ADT).

11. Clearly indicate the content of stack for 5 3 PSO1 PO1, 3

evaluating the following postfix expression. PO2


Assume A=10, B=2, C=13:
1. AB + C – BA – C + -
2. ABC + * CBA - + *

12. Write a C++ function to convert an infix 5 3 PSO1 PO1, 3

expression to postfix expression. PO2

13. Convert the following expression from infix 5 3 PSO1 PO1, 3

to postfix and prefix. Make use of the PO2


appropriate data structure which can be used
for conversion.
2 * 3 / (2 - 1) + 5 * 3
14. If the values of A,B,C and D are 2,3,4,and 5 5 3 PSO1 PO1, 3

respectively, calculate the value of the PO2


following postfix expressions:

1. AB * C – D +
2. ABC + * D –

15. Evaluate following expressions: 5 3 PSO1 PO1, 3

i. 2 3 * 2 1 - / 5 3 * + PO2

ii. + * 2 / 3 – 2 1 * 5 3

16. Convert the following infix expression to 5 3 PSO1 PO1, 3

postfix expression using stack. PO2


((A+B)*C-(D-E) ^ (F+G))
17. Define stack as an ADT. Use this stack to 6 3 PSO1, PO1, 3
swap two numbers. (Write sudo code). PSO2 PO2
18. Discuss the merits of circular queue over 8 3 PSO1, PO1, 3
linear queue and write sudo code for PSO2 PO2
overflow and under flow conditions of
circular queue.
19. Discuss the time complexity of removing an 4 3 PSO1 PO1 2
item from priority queue if sequential
memory organization is used.
20. Discuss how a two-way stack can be 9 3 PSO1, PO1, 3
developed using array and write sudo code PSO2 PO2
for Push, Pop and display operations.
21. Convert the following infix expressions to 9 3 PSO1 PO1, 3
postfix expressions using stack data structure. PO2
1) A+B*C^D-E/F
2) ((A+B)*C-(D-E))^(F+G)
22. Write a sudo code for Queue implementation 9 3 PSO1, PO1, 3
using array. Perform the following PSO2 PO2
operations:
1) Queue Full
2) Queue Empty
3) equeue
4) dqueue
23. Convert the following infix expressions to 9 3 PSO1, PO1, 3

prefix expressions using stack data structure. PSO2 PO2


i) A+B*C^D-E/F
ii) ((A+B)*C-(D-E))^(F+G)
24. Implement Priority queue using linked 9 3 PSO1, PO1, 3
representation and mention the time PSO2 PO2
complexity of operations.

25. Write sudo code for converting a given infix 9 3 PSO1, PO1, 3
expression to postfix expression and apply PSO2 PO2
the algorithm to convert (a+b)*c to postfix.
26. Contrast between the characteristics of stack 4 3 PSO1 PO1 3
and queue data structures.
27. Convert the following infix expressions to 9 3 PSO1 PO1, 3
postfix expressions and the content of the PO2
stack for each operation:
i) P * ( X/Y * Z – Q / (A+B))
ii) A + B $ (M-N) / D
($ for power operation)
28. Explain with example the significance of 6 3 PSO1 PO1, 3
priority queue over simple queue. PO2

Blooms
level no Blooms Taxonomy
terms

2
1

Note:
1. Example demonstrates the method for filling the data.
2. Blooms Taxonomy is provided for Ready Reference.

Subject In-charge HOD

You might also like