3rd Sem DATA STRUCTURE Assignment-1

Government Engineering College, Patan

B.E 3^rd SEM CSE Department

DATA STRUCTURE (2130702)

Assignment:-1

Stack:

1)      Define Data Structure and classify it.

2)      What do you mean by Data Structure? Give the difference between Primitive and Non-primitive data structures.

3)  Define array and give its representation.

4)  Discuss applications of an array.

5)  Discuss sparse matrix and its representation.

6)  What is Stack? Write down algorithms for performing PUSH and POP operations on a stack.

7)  Define the concept of recursion with suitable example.

8)  Discuss a stack application "Tower of Hanoi" with algorithm. 

9)  Convert following infix expression into postfix format showing stack status after every step in tabular form.

A. A+ (B*C-(D/E^F)*G)*H

B. (A*B+ (C/D))-F

C. A*B/C/D-E*F*G*(H-2)

E. A + B*(C+ D/E*F* (G + H) * I)-K

F. (A + B*C/D-E + F/G/ (H + I))

            G. (A + B) * C + D / (B + A * C) + D

H. A*(B+C/D*E)/ (F+G*H/ (I+J))

I. A+B*C-D/E*H

J. ((A+B)*C-(D-E)) / (F+G)

K. P * (Q - R/S * T) / (A + B * C/D + E)) + F

10)  Convert following infix expressions to polish (prefix) notation.

a. A+B*C-D/E*H

b. A*(B+C/D*E)/(F+G*H/(I+J))

11)  Convert following Infix expression into Postfix expression. Show each step.

A + B ^ C^ D - E * F / G

12)  Evaluate the following expression showing status of stack in tabular Form:

            a. 546+*493/+*

b. 7 5 2 + * 4 11 + / -

c. 3 5 * 6 2 / +

d. 12, 7, 3, -, /, 2, 1, 5, +, *, +

13)  Evaluate the following postfix expression using stack

        ABC+DE-*F+GH*++ ((where A=2, B=4, C=6, D=3, E=1, F=2, G=8, H=7))