Question Discussion & Solution

MCQ

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

Branch

Queue

Tree

Stack

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Stack

Queue

List

Link list

Discussion

MCQ

What happens when you pop from an empty stack while implementing using the Stack ADT in Java?

Undefined error

Compiler displays a warning

EmptyStackException is thrown

NoStackException is thrown

Discussion

MCQ

Stack in Data Structure is ___________.

FIFO

LILO

LIFO

None of these

Discussion

MCQ

What is the value of the postfix expression 6 3 2 4 +

Something between -5 and -15

Something between 5 and -5

Something between 5 and 15

Something between 15 and 100

Discussion

MCQ

Which of the following is useful in the implementation of quick sort ?

List

Set

Queue

Stack

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