Question 51 : The equivalent infix expression and value for the postfix form 1 2 + 3 * 4 5 * – will be
1. 1 + 2 * 3 – 4 * 5 and -13
2. (2 + 1) * (3 – 4) * 5 and 13
3. 1 + 2 * (3 – 4) * 5 and -11
4. (1 + 2) * 3 – (4 * 5) and -11
View Answer   Discuss with Members

Question 52 : The prefix expression of the postfix expression AB+CD-* is
1. (A+B)*(C-D)
2. +AB*-CD
3. A+*BCD-
4. *+AB-CD
View Answer   Discuss with Members

Question 53 : Reversing a word using stack can be used to find if the given word is a palindrome or not.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 54 : Which is the predefined method available in Java to convert decimal to binary numbers?
1. toBinaryInteger(int)
2. toBinaryValue(int)
3. toBinaryNumber(int)
4. toBinaryString(int)
View Answer   Discuss with Members

Question 55 : What will be the word obtained if the word 'abbcabb' is reversed using a stack?
1. bbabbca
2. abbcabb
3. bbacbba
4. bbacabb
View Answer   Discuss with Members

Question 56 : If the corresponding end bracket/braces/parentheses is encountered, which of the following is done?
1. push it on to the stack
2. pop the stack
3. throw an error
4. treated as an exception
View Answer   Discuss with Members

Question 57 : Which application of stack is used to ensure that the pair of parentheses is properly nested?
1. Balancing symbols
2. Reversing a stack
3. Conversion of an infix to postfix expression
4. Conversion of an infix to prefix expression
View Answer   Discuss with Members

Question 58 : What data structure is used when converting an infix notation to prefix notation?
1. Stack
2. Queue
3. B-Trees
4. Linked-list
View Answer   Discuss with Members

Question 59 : The result of the postfix expression 5 3 * 9 + 6 / 8 4 / + is
1. 8
2. 6
3. 10
4. 9
View Answer   Discuss with Members

Question 60 : Given two processes (conversion of postfix equation to infix notation and conversion of prefix notation to infix notation), which of the following is easier to implement?
1. Both are easy to implement
2. Conversion of postfix equation to infix equation is harder than converting a prefix notation to infix notation
3. Conversion of postfix equation to infix equation is easier than converting a prefix notation to infix notation
4. Insufficient data
View Answer   Discuss with Members