GATE CSE 2021 Set 1 | Stacks and Queues Question 6 | Data Structures

PREVIOUS NEXT

GATE CSE 2021 Set 1

Numerical

-0

Consider the following sequence of operations on an empty stack.

push(54); push(52); pop(); push(55); push(62); s = pop();

Consider the following sequence of operations on an empty queue.

enqueue(21); enqueue(24); dequeue(); enqueue(28); enqueue(32); q = dequeue();

The value of s + q is ______

Your input ____

GATE CSE 2016 Set 1

MCQ (Single Correct Answer)

-0.3

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($$n$$ refers to the number of items in the queue)?

Both operations can be performed in $$O\left( 1 \right)$$ time

At most one operation can be performed in $$O\left( 1 \right)$$ time but the worst case time for the other operation will be $$\Omega \left( n \right)$$

The worst case time complexity for both operations will be $$\Omega \left( n \right)$$

Worst case time complexity for both operations will be $$\Omega \left( {\log n} \right)$$

GATE CSE 2015 Set 3

MCQ (Single Correct Answer)

-0.3

The result evaluating the postfix expression $$10\,\,5\, + 60$$ $$\,\,6/\, * \,8\, - $$ is

$$284$$

$$213$$

$$142$$

$$71$$

GATE CSE 2005

MCQ (Single Correct Answer)

-0.3

A function f defined on stacks of integers satisfies the following properties. f(∅) = 0 and f (push (S, i)) = max (f(S), 0) + i for all stacks S and integers i. If a stack S contains the integers 2, -3, 2, -1, 2 in order from bottom to top, what is f(S)?