UNIT-3: TWO MARKS QUESTIONS
| Q. no | Question Description |
|---|---|
| 1 | Develop stack and explain it with a neat diagram. |
| 2 | Define Stack ADT? |
| 3 | What are the properties of a stack? |
| 4 | What are the conditions used to check Stack Overflow & Stack Underflow. |
| 5 | List out the different applications of Stack. |
| 6 | Discuss the importance of backtracking. |
| 7 | Write the postfix form for the expression: A+B-C+D. |
| 8 | How would you implement a stack using a singly linked list? |
| 9 | Write postfix and prefix form for the expression: A+(B*C)-D*E+F. |
| 10 | List the differences between stack and queue. |
UNIT-3: FIVE MARKS QUESTIONS
| Q. no | Question Description |
|---|---|
| 1 | Discuss different operations performed on stack with suitable examples. |
| 2 | Write an algorithm for Push and Pop operations of Stack and list out its applications. |
| 3 | Write a C program to implement stack operations using arrays. |
| 4 | How can a stack be implemented using linked list? Demonstrate the stack operations by taking example elements. |
| 5 | Interpret the procedure used to convert infix expression into postfix expression using stack. Convert (A+B)/(C-D)*(E-F). |
| 6 | Define stack and give one application. Convert (G*(M-H^A)-B/C+J%F+N). |
| 7 | Discuss the procedure for evaluating postfix expression. Evaluate: 24, 5, *, 7, 3, %, -, 9, -, 4, +. |
| 8 | Evaluate postfix expression: 2 6 + 1 3 2 4 5-*/%+. |
| 9 | Write a C program to evaluate postfix expression using stack. |
| 10 | Check whether expression is balanced using stack with example. |
| 11 | Explain reversing a list using stack with algorithm. |
| 12 | Explain “Stack is used for reversing a list” with algorithm. |
| 13 | Write a C program to check palindrome using stack. |
Comments
Post a Comment