1

GATE CSE 2022

Numerical

+1

-0.33

Consider the queues Q_{1} containing four elements and Q_{2} containing none (shown as the Initial State in the figure). The only operations allowed on these two queues are Enqueue (Q, element) and Dequeue (Q). The minimum number of Enqueue operations on Q_{1} required to place the elements of Q_{1} in Q_{2} in reverse order (shown as the Final State in the figure) without using any additional storage is ______________.

Your input ____

2

GATE CSE 2016 Set 1

MCQ (Single Correct Answer)

+1

-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)?3

GATE CSE 2015 Set 3

MCQ (Single Correct Answer)

+1

-0.3

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

4

GATE CSE 2005

MCQ (Single Correct Answer)

+1

-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)?

Questions Asked from Stacks and Queues (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages