The prefix form of A-B/ (C * D ^ E) is? a) -/*^ACBDE b) -ABCD*^DE c) -A/B*C^DE d) -A/BC*^DE Answer: ...
View QuestionWhich data structure is needed to convert infix notation to postfix notation?
a) Branch b) Tree c) Queue d) Stack Answer: d Explanation: The Stack data structure is used ...
View QuestionThe postfix form of A*B+C/D is?
a) *AB/CD+ b) AB*CD/+ c) A*BC+/D d) ABCD+/* Answer: b Explanation: Infix expression is (A*B)+(C/D) AB*+(C/D) AB*CD/+
View QuestionThe process of accessing data stored in a serial access memory is similar to manipulating data on a ________
a) Heap b) Binary Tree c) Array d) Stack Answer: d Explanation: In ...
View QuestionWhat data structure would you mostly likely see in non recursive implementation of a recursive algorithm?
a) Linked List b) Stack c) Queue d) Tree Answer: b Explanation: In recursive algorithms, the ...
View QuestionThe data structure required to check whether an expression contains a balanced parenthesis is?
a) Stack b) Queue c) Array d) Tree Answer: a Explanation: The stack is a simple data structure ...
View QuestionThe postfix form of the expression (A+ B)*(C*D- E)*F / G is?
The postfix form of the expression (A+ B)*(C*D- E)*F / G is? a) AB+ CD*E – FG ...
View QuestionHere is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?
Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to ...
View QuestionWhat is the value of the postfix expression 6 3 2 4 + – *?
What is the value of the postfix expression 6 3 2 4 + – *? a) ...
View QuestionConsider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?
a) 1 b) 2 c) 3 d) 4 or more Answer: b Explanation: In the entire parenthesis balancing method when the ...
View Question