Menu

Question Discussion & Solution

MCQ
Q.
In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is ............

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.
What is the result of the following operationTop (Push (S, X))
forum Discussion
MCQ
2.
What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?
forum Discussion
MCQ
3.
The prefix form of A-B/ (C * D ^ E) is?
forum Discussion
MCQ
4.
Consider following Scenario -1. The five items : P,Q,R,S and T are inserted into stack A one after other starting from T in reverse order.2. The stack is popped three times and each element is inserted into another stack B.3. Then two elements are deleted from the stack B and pushed back onto the stack A.What are the topmost elements of stack A and Stack B respectively?
forum Discussion
MCQ
5.
Post fix form of -(A + B) * C
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