In conversion from prefix to postfix using stack data-struct...

MCQ

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

?(1)

?(n)

?(log n)

?(n2)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Stack A has 3 Elements in it Say X,Y and Z with X on top.1. Stack B is empty.2. An Element popped out from Stack A can be printed immediately or pushed to stack B.3. An Element popped out from Stack B can only be printed.In this arrangement, which of the following permutations of X,Y,Z are not possible ?

Y X Z

Z X Y

Y Z X

Z Y X

Discussion

MCQ

Which of the following types of expressions does not require precedence rule when evaluated?

Prefix expression

More than one of these

Full parenthesized infix expression

Partially parenthesized infix expression

Discussion

MCQ

What is the time complexity for converting decimal to binary numbers?

O(1)

O(n)

O(logn)

O(nlogn)

Discussion

MCQ

Select the code snippet which returns the top of the stack.

public int top()
{
       if(q1.size()>0)
       {
            return q1.poll();
       }
       else if(q2.size()>0)
       {
            return q2.poll();
       }
       return 0;
}

public int top()
{
       if(q1.size()==0)
       {
            return q1.peek();
       }
       else if(q2.size()==0)
       {
            return q2.peek();
       }
        return 0;
    }

public int top()
{
       if(q1.size()>0)
       {
            return q1.peek();
       }
       else if(q2.size()>0)
       {
            return q2.peek();
       }
       return 0;
}

public int top()
{
       if(q1.size()>0)
       {
            return q2.peek();
       }
       else if(q2.size()>0)
       {
            return q1.peek();
       }
       return 0;
}

Discussion

MCQ

Consider the usual algorithm for determining whether a sequence of parentheses is balanced.
Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order).

The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?

4 or more

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