BANGALORE INSTITUTE OF TECHNOLOGY

K.R.Road, V.V. Puram, Bangalore

DEPARTMENT OF M.C.A

Semester - 1st Test : 1st

Subject : Data Structures and Algorithms Max Marks : 30
Time : 75 min
Answer ANY THREE Questions

Questions Marks CO PO
1. A) Illustrate the different types of data structures with neat diagram 5 1 1,2,3

and with the definition of data structures.

B) Demonstrate the different operations of data structures.
5 1 1,2,3
OR
2. A) Define Stack? Implement the operations of Stack Using C?
6 1 1,2,3
B) Define different types of arithmetic expression with examples?

4 1 1,2,3
3. Design an algorithm to convert an Infix expression to postfix. Trace
the algorithm for the following infix expression, ((A*(B+C/D)*E)
+F*G).
10 1 1,2,3
OR
4. A) Convert the following expression into POSTFIX and PREFIX.
((X-Y^(B/C*D) +E) +F*G/H*I).
B) Convert the following expression into Infix form. 5 1 1,2,3

A,B,C,*,-,D,E,F,/,+,*,G,+,H,+.

5 1 1,2,3
5. A) Briefly explain the Direct and Indirect applications of Stack?
B) Evaluate the postfix expression by showing the contents of Stack.
2,1,2,^,^,4,-,3,+,-4,5,4,/,+
OR
6. Design an algorithm to evaluate a postfix expression. Trace the 4 1 1,2,3
algorithm for the following postfix expression showing the contents
6 1 1,2,3
of Stack. 3,2,1,^,*,3,10,2,/,-,*,2,/,3,+.

10 1 1,2,3

Course-Coordinator Module-Coordinator

IQAC Program-Coordinator