1. Computer Science - Class 12
  2. Chapter 3 - Stacks
  3. Past Year - 2 Mark Questions
Check sibling questions

Question 6 - Past Year - 2 Mark Questions - Chapter 3 - Stacks

Last updated at Aug. 14, 2026 by Teachoo

Define stack.

Answer:

A stack is a data structure in which elements are arranged in a linear order. 

In a stack, insertion and deletion takes place at one end i.e., the top of the stack. 

 

Additional points: 

  • Inserting into a stack is called a PUSH operation and deleting from a stack is called a POP operation.
  • A stack follows the LIFO principle i.e., an element which is inserted last will be the first one to be taken out.

Transcript

Define stack. Answer: A stack is a data structure in which elements are arranged in a linear order. In a stack, insertion and deletion takes place at one end i.e., the top of the stack. Additional points: Inserting into a stack is called a PUSH operation and deleting from a stack is called a POP operation. A stack follows the LIFO principle i.e., an element which is inserted last will be the first one to be taken out.
  1. Computer Science - Class 12
  2. Chapter 3 - Stacks

    3. Past Year - 2 Mark Questions

    Past Year - 3 Mark Questions →
Past Year - 3 Mark Questions →
Computer Science - Class 12
Chapter 3 - Stacks

About the Author

Davneet Singh

Davneet Singh is an IIT Kanpur graduate and has been teaching for 16+ years. At Teachoo, he breaks down Maths, Science and Computer Science into simple steps so students understand concepts deeply and score with confidence.

Many students prefer Teachoo Black for a smooth, ad-free learning experience.