Class 12 Stack MCQ | Class 12 Computer Science Stack Quiz

Preview

Class 12 Stack MCQ | Class 12 Computer Science Stack Quiz



0%

1 / 18

Choose correct output for the following sequence of operations (★ signifies top).

push(50), push(80), pop, push(20), push(50), pop, push(10)

2 / 18

The technical terms for insertion-in-a-stack and deletion-from-stack are ____ and ____ respectively.

3 / 18

When a stack is empty and an element's deletion is tried from the stack, it is called an ______ .

4 / 18

Push and Pop are terms related to stack data structure.

5 / 18

In a stack, all insertions take place at _____ end(s).

6 / 18

Stack does not follow LIFO rule?

7 / 18

 PUSH operation may result into underflow condition

8 / 18

In  a Stack, deletions take place at ____ end.

9 / 18

Which of the following is an application of stack ?

10 / 18

Which is the best data type to implement stack in Python

11 / 18

Choose correct output for the following sequence of operations(. signifies top).

Push(5),   Pop , Push(8),   Pop,  Push(2),  Push(5),  Pop,  Push(1)

12 / 18

Pushing an element into stack already having five elements and stack has fixed size of 5, then ____ occurs.

13 / 18

Pushing in a full fixed size stack results into an error.

14 / 18

The terms Push and Pop are related to

15 / 18

Popping from an empty stack results into an error.

16 / 18

Entries in a stack are "ordered". What is the meaning of this statement?

17 / 18

What is the output of following code:

result=0
List=[10,20,30]
List.append(40)
result=result+numberList.pop()
result=result+numberList.pop()
print("Result=",result)

18 / 18

A stack is a linear structure implemented in LIFO(___ ___ ___ ___) manner.



 

Lesson tags: Class 12 Stack MCQ, Class 12 Stack Quiz
Back to: CBSE class 12 Computer Science notes