Question 21 : When converting the prefix notation into an infix notation, the first step to be followed is ________
1. Reverse the equation
2. Push the equation to the stack
3. Push the equation onto the queue
4. Push the equation to the stack or queue
View Answer   Discuss with Members

Question 22 : What determines the order of evaluation of a prefix expression?
1. precedence and associativity
2. precedence only
3. associativity only
4. depends on the parser
View Answer   Discuss with Members

Question 23 : How many stacks are required for evaluation of prefix expression?
1. one
2. two
3. three
4. four
View Answer   Discuss with Members

Question 24 : What is the time complexity of balancing parentheses algorithm?
1. O (N)
2. O (N log N)
3. O (M log N)
4. O (N²)
View Answer   Discuss with Members

Question 25 : How many types of input characters are accepted by this algorithm?
1. one
2. two
3. three
4. four
View Answer   Discuss with Members

Question 26 : What should be done when a left parenthesis '(' is encountered?
1. It is ignored
2. It is placed in the output
3. It is placed in the operator stack
4. The contents of the operator stack is emptied
View Answer   Discuss with Members

Question 27 : Which of the following is not an application of stack?
1. evaluation of postfix expression
2. conversion of infix to postfix expression
3. balancing symbols
4. line at ticket counter
View Answer   Discuss with Members

Question 28 : What is the time complexity of reversing a word using stack algorithm?
1. O (N log N)
2. O (N²)
3. O (N)
4. O (M log N)
View Answer   Discuss with Members

Question 29 : Using the evaluation of prefix algorithm, evaluate +-9 2 7.
1. 10
2. 4
3. 17
4. 14
View Answer   Discuss with Members

Question 30 : Reverse Polish Notation is the reverse of a Polish Notation
1. True
2. False
3.
4.
View Answer   Discuss with Members