Explain push and pop operations of stack. What are different applications of stack?
Marks: 5Chapter: Unit 2: Stack (4 Hrs.)
Chapter Study
Bsc CSIT Semester 3 – Data Structure and Algorithms – Unit 2: Stack (4 Hrs.)
Comprehensive questions and detailed answers for Unit 2: Stack (4 Hrs.). Perfect for exam preparation and concept clarity.
7
Questions
45
Marks
Explain push and pop operations of stack. What are different applications of stack?
MediumTHEORY5 marks2080(TU Final)
Convert the infix expression A+(((B-C)*(D-E)+F)/G)$(H-I) into post expression using stack.
MediumTHEORY5 marks2081(TU Final)
How recursive algorithm uses stack to store intermediate results? Illustrate with an example. Convert the infix expression A+B-(CD/E+F)-GH into postfix expression using stack.
HardTHEORY10 marks2079(TU Final)
Evaluate the postfix expression 574-*8/4+ using stack.
MediumTHEORY5 marks2079(TU Final)
Evaluate the expression ABCD-x+ using stack where A=5, B=4, C=3 and D=7
MediumTHEORY5 marks2078(TU Final)
What is stack? What are the different applications of stack? Explain stack operations with example.
HardTHEORY10 marks2077(TU Final)
Explain algorithm for evaluation of postfix expression using stack
MediumTHEORY5 marks2077(TU Final)
Showing 7 questions
Sample Questions
Convert the infix expression A+(((B-C)(D-E)+F)/G)$(H-I) into post expression using stack.
Marks: 5Chapter: Unit 2: Stack (4 Hrs.)
How recursive algorithm uses stack to store intermediate results? Illustrate with an example. Convert the infix expression A+B-(CD/E+F)-GH into postfix expression using stack.
Marks: 10Chapter: Unit 2: Stack (4 Hrs.)
Evaluate the postfix expression 574-8/4+ using stack.
Marks: 5Chapter: Unit 2: Stack (4 Hrs.)
Evaluate the expression ABCD-x+ using stack where A=5, B=4, C=3 and D=7
Marks: 5Chapter: Unit 2: Stack (4 Hrs.)
And more questions available on this page.