1

GATE CSE 2004

MCQ (Single Correct Answer)

+1

-0.3

The best data structure to check whether an arithmetic expression has balanced parentheses is a

2

GATE CSE 1997

MCQ (Single Correct Answer)

+1

-0.3

Which of the following is essential for converting an infix expression to the postfix form efficiently?

3

GATE CSE 1996

MCQ (Single Correct Answer)

+1

-0.3

Consider the following statements:

(i) First-in-first out types of computations are efficiently supported by STACKS.

(ii) Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations.

(iii) Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices.

(iv) Last-in-first-out type of computations are efficiently supported by QUEUES.

(i) First-in-first out types of computations are efficiently supported by STACKS.

(ii) Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations.

(iii) Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices.

(iv) Last-in-first-out type of computations are efficiently supported by QUEUES.

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