HamiIT
Sign inGet started
Home
Theme
ADD CONTENT

Sign in Required

Please sign in to add content

Sign In
ProgramsBCASemester 3Data Structure and AlgorithmsUnit 2: The Stack (3Hrs)
Chapter Study

BCA Semester 3 – Data Structure and Algorithms – Unit 2: The Stack (3Hrs)

Comprehensive questions and detailed answers for Unit 2: The Stack (3Hrs). Perfect for exam preparation and concept clarity.

8
Questions
50
Marks
Back to All Chapters
1

What is Data Structure? Show the status of stack converting following infix expression to post fix: P+Q−(R∗S/T+U)−V∗WP + Q - (R*S/T+U)-V*WP+Q−(R∗S/T+U)−V∗W

MediumTHEORY5 marks2019(TU FOHSS Final)
2

What is stack? List the applications of stack. Write an algorithm or procedure to perform PUSH and POP operation in stack.

MediumTHEORY10 marks2019(TU FOHSS Final)
3

Write an algorithm to convert infix expression to postfix.

MediumTHEORY5 marks2021(TU FOHSS Final)
4

What is abstract data type? convert a$b*c-d+e/f/(g+h) into postfix expression using stack.

MediumTHEORY5 marks2022(TU FOHSS Final)
5

What is stack? List the application of the stack. Write an algorithm to perform PUSH and POP operation in stack. Describe linked list implementation of stack operations.

HardTHEORY10 marks2022(TU FOHSS Final)
6

Define stack. Why stack is considered as an ADT? List any four applications of stack.

MediumTHEORY5 marks2023(TU FOHSS Final)
7

Evaluate the following postfix expression using the stack: 45+73−2+∗4 5 + 7 3 - 2 + *45+73−2+∗

MediumTHEORY5 marks2023(TU FOHSS Final)
8

Differentiate between stack and queue. What are the general applications of a stack?

MediumTHEORY5 marks2024(TU FOHSS Final)
Showing 8 questions

Sample Questions

What is Data Structure? Show the status of stack converting following infix expression to post fix: \(P + Q - (RS/T+U)-VW\)

Marks: 5Chapter: Unit 2: The Stack (3Hrs)

What is stack? List the applications of stack. Write an algorithm or procedure to perform PUSH and POP operation in stack.

Marks: 10Chapter: Unit 2: The Stack (3Hrs)

Write an algorithm to convert infix expression to postfix.

Marks: 5Chapter: Unit 2: The Stack (3Hrs)

What is abstract data type? convert a$bc-d+e/f/(g+h) into postfix expression using stack.

Marks: 5Chapter: Unit 2: The Stack (3Hrs)

What is stack? List the application of the stack. Write an algorithm to perform PUSH and POP operation in stack. Describe linked list implementation of stack operations.

Marks: 10Chapter: Unit 2: The Stack (3Hrs)

And more questions available on this page.

About Unit 2: The Stack (3Hrs) Questions

This page contains comprehensive questions from the Unit 2: The Stack (3Hrs) chapter of Data Structure and Algorithms, part of the BCA Semester 3 curriculum. All questions include detailed model answers from past TU exam papers.

Study Tips

  • Review concepts before attempting questions
  • Practice writing complete answers
  • Compare your answers with model solutions
  • Focus on questions from recent years
  • Use direct links (#question-ID) to bookmark and share specific questions

Related Resources

← Back to Data Structure and Algorithms Chapters

Unit 2: The Stack (3Hrs) chapter questions with answers for Data Structure and Algorithms (BCA Semester 3). Prepare for TU exams with our comprehensive question bank and model answers.

H
Hami IT

Empowering IT students with quality education resources and comprehensive exam preparation materials.

Programs

  • Flutter
  • Java
  • DevOps

Company

  • About Us
  • Contact
  • Terms of Service
  • Privacy Policy

Contact

  • 📧contact@hamiit.com
  • 📞+977 9813706443
  • 📍Kathmandu, Nepal

Community

  • Join Discord
  • Report a bug
  • Request feature

© 2026 Hami IT. All rights reserved.