Chapter 3: Stack (Data Structure)
1 / 50
Stack allows access at:
2 / 50
Peek returns:
3 / 50
Top pointer moves on pop:
4 / 50
Top pointer moves on push:
5 / 50
Stack is:
6 / 50
Opposite of stack:
7 / 50
Stack size decreases by:
8 / 50
Stack size increases by:
9 / 50
Top element accessed by:
10 / 50
Function call stack for:
11 / 50
Recursion uses:
12 / 50
Stack helps in:
13 / 50
A+B postfix:
14 / 50
A+B*C postfix:
15 / 50
No parentheses needed in:
16 / 50
Stack is used in:
17 / 50
In postfix operator is:
18 / 50
Prefix format:
19 / 50
Postfix format:
20 / 50
Infix format:
21 / 50
stack[-1] gives:
22 / 50
len(stack)==0 means:
23 / 50
Function for size:
24 / 50
S=[10]; S.append(20) =>
25 / 50
S=[1,2,3]; S.pop() =>
26 / 50
pop() removes:
27 / 50
append(10) does:
28 / 50
Pop in Python:
29 / 50
Push in Python:
30 / 50
Python stack implemented using:
31 / 50
Overflow occurs when:
32 / 50
Underflow occurs when:
33 / 50
NOT a stack operation:
34 / 50
Stack implemented using:
35 / 50
Return top without removing:
36 / 50
After pop, TOP:
37 / 50
After push, TOP:
38 / 50
Initial TOP value:
39 / 50
Condition for overflow:
40 / 50
Function to check empty stack:
41 / 50
Stack works on:
42 / 50
Adding to full stack causes:
43 / 50
Removing from empty stack causes:
44 / 50
Real-life example of stack:
45 / 50
POP operation means:
46 / 50
PUSH operation means:
47 / 50
Pointer indicating top element is called:
48 / 50
Insertion in stack is done at:
49 / 50
Stack is a ______ data structure.
50 / 50
A stack follows which principle?
Your score is
The average score is 0%
