Stacks In Data Structures - Study Mode

Show All Answers

[#91] For the given expression tree, write the correct postfix expression.

(A) abc*+

(B) abc+*

(C) ab+c*

(D) a+bc*

Correct Answer

(A) abc*+

[#92] Operations required for reversing a word or a string using stack are push() and pop().

(A) True

(B) False

Correct Answer

(A) True

[#93] In balancing parentheses algorithm, the string is read from?

(A) right to left

(B) left to right

(C) center to right

(D) center to left

Correct Answer

(B) left to right

[#94] What will be the word obtained if the word "abbcabb" is reversed using a stack?

(A) bbabbca

(B) abbcabb

(C) bbacbba

(D) bbacabb

Correct Answer

(C) bbacbba

[#95] Evaluate the following statement using infix evaluation algorithm and choose the correct answer. 1+2*3-2

(A) 3

(B) 6

(C) 5

(D) 4

Correct Answer

(C) 5