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
A
queue
B
stack
C
tree
D
list
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?
A
An operator stack
B
An operand stack
C
An operand stack and an operator stack
D
A parse tree
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.
A
(ii) and (iii) are true
B
(i) and (ii) are true
C
(iii) and (iv) are true
D
(ii) and (iv) are true
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12