Questions On Stack- Data Structure Sem: II

Laxmi Institute of Computer Applications (MCA)
Subject: 620001 – Data Structure Sem: II
Question set - I Academic Year: 2010 - 2011
By : ManjoorHussain Kapoor 1

Q1) What is meant by recursive algorithm?

Q2) Define and explain the data structure stacks.

Q3) What are the operations on stack and an important use for this structure?

Q4) Explain how infix expressions are converted to polish notation. Illustrate the answer
with suitable example ?

Q5) Discuss the use of a stack in implementing recursive procedures.

Q6) Explain recursion with one example.

Q7) Write an algorithm for deleting an element from a stack.

Q8) Show how to evaluate the expression in the postfix using stack.

Q9) Discuss the application of stacks.

Q10) Write an algorithm to transform from prefix to postfix.

Q11) Explain the principle of recursive algorithm.

Q12) Outline an algorithm to convert a given postfix expression to infix form.

Q13) Explain the implementation of stack using arrays and linked list. Write appropriate functions to
perform valid operations on stack.

Q14) What is a Stack? Explain any two operations performed on a Stack with required algorithms.

Q15) Convert the following infix expression into postfix form (A + B)* (C + B)* (ElF).

Q16) What is recursion? Give the application of recursion with programs.

Q17) What are the various stack operations? Explain.

Q18) Explain the application of stack for conversion of infix to postfix.

Q19) Write procedures for Push and Prop operations on stacks.

Q20) Write procedure to convert infix to portfix expressions.

Q21) Explain the linked list implementation of a LIFO structure.

Q22) Write the prefix and postfix form for: A + B * (C - D) / (E - F).

Q23) Which data structure would you use for recursive procedures?

Q24) Explain how a postfix expression is evaluated using stack with suitable example ?