Which of the following permutations can be obtained in the o...

MCQ

Which of the following permutations can be obtained in the output(in the same order),using a stack assuming that the input is the sequence 1,2,3,4,5 in that order?

1,5,2,3,4

3,4,5,2,1

3,4,5,1,2

5,4,3,2,1

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Which of the following real world scenarios would you associate with a stack data structure?

piling up of chairs one above the other

people standing in a line to be serviced at a counter

offer services based on the priority of the customer

all of the mentioned

Discussion

MCQ

Stacks cannot be used to

implement recursion

evaluate an arithmetic expression

allocate resources (like CPU) by the operating system

convert a given arithmetic expression in infix form to its equivalent postfix form

Discussion

MCQ

Which is the predefined method available in Java to convert decimal to binary numbers?

toBinaryInteger(int)

toBinaryValue(int)

toBinaryNumber(int)

toBinaryString(int)

Discussion

MCQ

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

Algebraic

Arithmetic

Trigonometric

Geometric

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

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