Evaluation of a Prefix Expression Question with FREE PDF

We have the best collection of the evaluation of a Prefix Expression question and answer with FREE PDF. These questions and Answers will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

Evaluation of a Prefix Expression Question

1. In the given C snippet, find the statement number that has error.
//C code to push an element into a stack
1. void push( struct stack *s, int x) 
2. {
3.     if(s->top==MAX-1)
4.     {
5.         printf(“stack overflow”);
6.     }
7.     else
8.     {
9.         s->items[++s->top]=x;
10.        s++;
11.    }   
12. }

a) 1

b) 9

c) 10

d) 11

Answer: 10

2. While evaluating a prefix expression, the string is read from?

a) left to right

b) right to left

c) center to right

d) center to left to right

Answer: right to left

3. The associativity of an exponentiation operator ^ is right side.

a) True

b) False

Answer: True

4. How many types of input characters are accepted by this algorithm?

a) one

b) two

c) three

d) four

Answer: three

5. What determines the order of evaluation of a prefix expression?

a) precedence and associativity

b) precedence only

c) associativity only

d) depends on the parser

Answer: precedence and associativity

6. Find the output of the following prefix expression.

*+2-2 1/-4 2+-5 3 1

a) 2

b) 12

c) 10

d) 4

Answer: 2

7. An error is thrown if the character ‘\n’ is pushed in to the character stack.

a) true

b) false

Answer: false

8. Using the evaluation of prefix algorithm, evaluate +-9 2 7.

a) 10

b) 4

c) 17

d) 14

Answer: 14

9. If -*+abcd = 11, find a, b, c, d using evaluation of prefix algorithm.

a) a=2, b=3, c=5, d=4

b) a=1, b=2, c=5, d=4

c) a=5, b=4, c=7,d=5

d) a=1, b=2, c=3, d=4

Answer: a=1, b=2, c=5, d=4

10. How many stacks are required for evaluation of prefix expression?

a) one

b) two

c) three

d) four

Answer: two

PDF Download (Evaluation of a Prefix Expression)