NCERT solutions for Computer Science [English] Class 12 chapter 3 - Stack [Latest edition]

State TRUE or FALSE for the following case:

Stack is a linear data structure.

State TRUE or FALSE for the following case:

Stack does not follow LIFO rule.

State TRUE or FALSE for the following case:

PUSH operation may result into underflow condition.

State TRUE or FALSE for the following case:

In POSTFIX notation for expression, operators are placed after operands.

Find the output of the following code:

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

Find the output of the following code:

answer=[]; output=''
 answer.append('T')
 answer.append('A')
 answer.append('M')
 ch=answer.pop()
 output=output+ch
 ch=answer.pop()
 output=output+ch
 ch=answer.pop()
 output=output+ch
 print(“Result=”,output)

Write a program to reverse a string using stack.

For the following arithmetic expression:

((2+3)*(4/2))+2

Show step-by-step process for matching parentheses using stack data structure.

Evaluate following postfix expression while showing status of stack after the operation given A = 3, B = 5, C = 1, D = 4.

A B + C *

Evaluate following postfix expressions while showing status of stack after the operation given A = 3, B = 5, C = 1, D = 4.

A B * C / D *

Convert the following infix notations to postfix notations, showing stack and string contents at following step.

A + B - C * D

Convert the following infix notations to postfix notations, showing stack and string contents at following step.

A * ((C + D)/E)

Write a program to create a Stack for storing only odd numbers out of all the numbers entered by the user. Display the content of the Stack along with the largest odd number in the Stack. (Hint. Keep popping out the elements from stack and maintain the largest element retrieved so far in a variable. Repeat till Stack is empty).