Menu

Question Discussion & Solution

MCQ
Q.
In a computer system, when an __________ expression in an infix notation needs to be evaluated, it is first converted into its postfix notation?

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
The equivalent prefix expression for the following infix expression (A+B)-(C+D*E)/F*G is
forum Discussion
MCQ
2.
push() and pop() functions are found in
forum Discussion
MCQ
3.
Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation.
The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?
forum Discussion
MCQ
4.
Which of the following types of expressions do not require precedence rules for evaluation?
forum Discussion
MCQ
5.
To implement a stack using queue(with only enqueue and dequeue operations), how many queues will you need?
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
article

Abstract data types

format_list_bulleted 37 MCQs
article

Arrays

format_list_bulleted 134 MCQs
article

Lists

format_list_bulleted 166 MCQs
article

Stacks

format_list_bulleted 165 MCQs
article

Queues

format_list_bulleted 61 MCQs
article

Trees

format_list_bulleted 133 MCQs
article

Binary Trees

format_list_bulleted 120 MCQs
article

B Trees

format_list_bulleted 8 MCQs
article

Heaps

format_list_bulleted 36 MCQs
article

Hash based structures

format_list_bulleted 7 MCQs
article

Graphs

format_list_bulleted 157 MCQs
article

Mixed

format_list_bulleted 10 MCQs