DSC QUIZ 3

Prefix expression also called ___________

• Polish Notation
• Suffix
• Infix
• Reverse Infix

The prefix equivalent to infix a + ( b – c) * e / f

• + * / a - b c / d e
• + a / * - b c e f
• - + a b * c d / e
• / + a * - b c e f

In__________ notation the operator comes first and then operand

• infix
• prefix
• suffix
• postfix

Convert the given infix expression into prefix expression. Infix expression is a/b-c/d___________

• -/ab/cd
• /ab/c-d
• ab/-cd/
• /-ab/cd

The value of postfix expression is 9 1 + 2 3 + / 2 *

• 1
• 2
• 3
• 4

The evaluation of postfix expression, the data structure used is ________

• Stack
• Queue
• Array
• Binary Tree

Evaluate the given postfix expression : A B + A B - / Value of A=5, B=3

• 2
• 3
• 4
• 5

Evaluate the expression / + 1 1 – 4 3

• 1
• 2
• 3
• 4

The value of prefix expression is / * + 8 1 – 3 1 6

• 1
• 2
• 3
• 4

Tower of Hanoi is an application of __________

• Stack
• Queue
• Array
• Binary Tree