# HackWithInfy Stack Quiz-2

Question 1

Time: 00:00:00
What is Postfix Conversion in Stack?

When an operator is followed for every pair of operands like ‘a’ ‘b’ operator .

When an operator is followed for every pair of operands like ‘a’ ‘b’ operator .

When an operator is in-between every pair of operands like ‘a’ operator ‘b’.

When an operator is in-between every pair of operands like ‘a’ operator ‘b’.

Both a and b

Both a and b

None

None

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 2

Time: 00:00:00
What is Prefix Conversion in Stack?

it requires that all operators precedence the two operands that they work on, like + A * B C

it requires that all operators precedence the two operands that they work on, like + A * B C

it requires that its operators come after the corresponding operands, like A B C * +

it requires that its operators come after the corresponding operands, like A B C * +

it requires operator is in between the two operands that it is working on, like A + B * C

it requires operator is in between the two operands that it is working on, like A + B * C

None

None

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 3

Time: 00:00:00
What should be done when a left parenthesis ‘(‘ occurs in the expression?

placed in the output

placed in the output

placed in the operator stack

placed in the operator stack

ignored

ignored

a and b

a and b

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 4

Time: 00:00:00
Time complexity of an infix to postfix conversion algorithm is ?

O(n)

O(n)

O(n log n)

O(n log n)

O(n2)

O(n2)

None

None

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 5

Time: 00:00:00
Convert the infix expression given below to postfix expression?

a+b*c+(d*e)

a*bc+*de+

a*bc+*de+

a+bc*+de*

a+bc*+de*

abc++de**

abc++de**

abc*+de*+

abc*+de*+

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 6

Time: 00:00:00
Check which is the correct postfix expression of the following?

a+b*(c^d-e)^(f+g*h)-i

a+b*(c^d-e)^(f+g*h)-i

a+b*(c^d-e)^(f+g*h)-i

abcd^e-fgh*+^*+i-

abcd^e-fgh*+^*+i-

abcd^efgh*+^*+i--

abcd^efgh*+^*+i--

abcd^e-fgh*+^*-i+

abcd^e-fgh*+^*-i+

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 7

Time: 00:00:00
Solve the following into prefix notation?

18

18

13

13

12

12

11

11

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 8

Time: 00:00:00
How many stacks are required when using the expression like postfix,infix and prefix?

tuning machine needed

tuning machine needed

one stack needed

one stack needed

two stack needed

two stack needed

many stack needed as per the expression length

many stack needed as per the expression length

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 9

Time: 00:00:00
When you have two processes :-

i)

i)

ii)

ii)

both a and b

both a and b

none a and b

none a and b

Once you attempt the question then PrepInsta explanation will be displayed.

Start

Question 10

Time: 00:00:00
What will be the equivalent infix expression and value for the postfix form 4 2 + 3 * 4 5 * -____   ____.

(4 * 2) + 3 - (5 * 4) and -9

(4 * 2) + 3 - (5 * 4) and -9

(4 + 4) * 3 - (2 * 5) and 4

(4 + 4) * 3 - (2 * 5) and 4

(4 + 2) * 3 - (4 * 5) and -2

(4 + 2) * 3 - (4 * 5) and -2

(4 + 3) * 2 - (4 * 5) and -6

(4 + 3) * 2 - (4 * 5) and -6

Once you attempt the question then PrepInsta explanation will be displayed.

Start

["0","40","60","80","100"]
["Need more practice!","Keep trying!","Not bad!","Good work!","Perfect!"]

Personalized Analytics only Availble for Logged in users

Analytics below shows your performance in various Mocks on PrepInsta

Your average Analytics for this Quiz

Rank

-

Percentile

0%

Completed

0/0

Accuracy

0%