Stacks In Data Structures - Study Mode

Show All Answers

[#86] How many types of input characters are accepted by this algorithm?

(A) one

(B) two

(C) three

(D) four

Correct Answer

(C) three

[#87] Consider the postfix expression 4 5 6 a b 7 8 a c, where a, b, c are operators. Operator a has higher precedence over operators b and c. Operators b and c are right associative. Then, equivalent infix expression is

(A) 4 a 5 6 b 7 8 a c

(B) 4 a 5 c 6 b 7 a 8

(C) 4 b 5 a 6 c 7 a 8

(D) 4 a 5 b 6 c 7 a 8

Correct Answer

(C) 4 b 5 a 6 c 7 a 8

[#88] In infix to postfix conversion algorithm, the operators are associated from?

(A) right to left

(B) left to right

(C) centre to left

(D) centre to right

Correct Answer

(B) left to right

[#89] Which of the following is an infix expression?

(A) (a+b)*(c+d)

(B) ab+c*

(C) +ab

(D) abc+*

Correct Answer

(A) (a+b)*(c+d)

[#90] Evaluate and write the result for the following postfix expression abc+def+g*+ where a=1, b=2, c=3, d=4, e=5, f=6, g=2.

(A) 61

(B) 59

(C) 60

(D) 55

Correct Answer

(B) 59