Data Structures
Stacks and Queues
Marks 1Marks 2
Linked List
Marks 1Marks 2
1
GATE CSE 1998
Subjective
+2
-0
Compute the post fix equivalent of the following expression. 3 * log(x+1) - a/2
2
GATE CSE 1998
MCQ (Single Correct Answer)
+2
-0.6
What value would the following function return for the input x = 95?
 function fun (x:integer):integer; 
   Begin 
      If x > 100 then fun : x – 10 
      Else fun : fun(fun (x + 11)) 
   End; 
A
89
B
90
C
91
D
92
3
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
A priority queue Q is used to implement a stack that stores characters. PUSH (C) is implemented INSERT (Q, C, K) where K is an appropriate integer key chosen by the implementation. POP is implemented as DELETEMIN(Q). For a sequence of operations, the keys chosen are in
A
non-increasing order
B
non-decreasing order
C
strictly increasing order
D
strictly decreasing order
4
GATE CSE 1995
MCQ (Single Correct Answer)
+2
-0.6
The postfix expression for the infix expression A + B * (C + D) / F + D * E is:
A
AB + CD + *F/D + E*
B
ABCD + *F/+DE*+
C
A *B + CD/F *DE++
D
A + *BCD/F* DE++
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization