Question Discussion & Solution

MCQ

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

Array

Queue

Stack

Tree

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

__________is a linear data structure in which an element can be added or removed only at one end.

Stack

Queue

String

Linked List

Discussion

MCQ

Prefix notation is also known as

Reverse Polish Notation

Reverse Notation

Polish Reverse Notation

Polish Notation

Discussion

MCQ

Which data structure is needed to convert infix notation to postfix notation?

Branch

Queue

Tree

Stack

Discussion

MCQ

The prefix form of A-B/ (C * D ^ E) is?

-/*^ACBDE

-ABCD*^DE

-A/B*C^DE

-A/BC*^DE

Discussion

MCQ

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

Infix Expression

Postfix Expression

Prefix Expression

None of the above

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