K.C.E.

S’S

College of Engineering And Information Technology , Jalgaon.

Department of Information Technology.

QUESTION BANK FOR UNIT TEST

Subject: DSF Class: SE(IT)

Note: Figures to right indicate full marks.

1. Define term data type, data object and data structure? Give an example for each
term. 10
2. Consider an array A [0…..n-1] is used to represent circular queue with tag front and
rear pointers with usual notations. 10
3. Write a procedure for display the content of circular queue from front & rear.
Graphically represent the same. 10
4. Write a procedure to convert a post fix expressions to prefix from? Give an example,
& solve it stepwise according to procedure? 10
5. Convert the following infix expression into prefix & postfix form? Show each step
clearly. 10
a) A+B*C^D^E-F/G.
b) (A-B)*D-(K/E)^F+G.
c) A^B*C+D-E/F^G
d) –P^Q^R*S.
6. Discus any one application of stack using an example? 5
7. Write a procedure to ADD and DELETE element form circular queue 10
8. What is mean by queue? 5
9. Write an algorithm to transform prefix to postfix? 10
10. Discuss different representation of priority queue? 5

11. What is mean by stack? Explain with example. 10

12. Write the application of queue? 5

13. Write note on tower of Hanoi problem? 5

14. Write short note on multi stack & multi queue? 5

15. Write a short note on polish notations? 5

********* Good Luck *********