Question Discussion & Solution

MCQ

What is the time complexity of pop() operation when the stack is implemented using an array?

O(1)

O(n)

O(logn)

O(nlogn)

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 name does not relate to stacks?

FIFO lists

LIFO list

Piles

Push-down lists

Discussion

MCQ

The prefix form of an infix expression p + q − r t* is

+ pq − rt

− +pqr t*

− +pq*rt

- +*pqrt

Discussion

MCQ

One can determine whether an infix expression has balanced parenthesis or not by using .............

Array

Queue

Stack

Tree

Discussion

MCQ

In C programming, when we remove an item from bottom of the stack, then ?

The stack will fall down.

Stack will rearranged items.

It will convert to LIFO

This operation is not allowed.

Discussion

MCQ

What is the result of the following operation:Top (Push (S, X))

null

None of these

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