Question Discussion & Solution

MCQ

Post fix form of -(A + B) * C

AB + C*

ABC * +

ABC + *

AB * C +

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Consider the usual algorithm for determining whether a sequence of parentheses is balanced. What is the maximum number of parentheses that will appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(()))

Discussion

MCQ

What will be the postfix form of the above expression -(A+B)*(C*D-E)*F/G

A B + C D E * - F G / * *

A B + C D ∗ E − F G / ∗ ∗

A B + C D ∗ E − F G ∗ / ∗

None of these

Discussion

MCQ

Expression in which Operator is written after Operand is called as ________.

Infix Expression

Postfix Expression

Prefix Expression

None of the above

Discussion

MCQ

If the elements

ABCD

DCBA

DCAB

ABDC

Discussion

MCQ

One can determine whether an infix expression has balanced parenthesis or not by using .............

Array

Queue

Stack

Tree

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics