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 1998
MCQ (Single Correct Answer)
+1
-0.3
Which of the following statements is false?
A
A tree with a n nodes has (n – 1) edges
B
A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results.
C
A complete binary tree with n internal nodes has (n + 1) leaves.
D
The maximum number of nodes in a binary tree of height h is ( 2h+1 - 1 ).
4
GATE CSE 1998
MCQ (Single Correct Answer)
+2
-0.6
A complete n-ary tree is one in which every node has O or n sons. If x is the number of internal nodes of a complete n-ary tree, the number of leaves in it is given by
A
x(n – 1) +1
B
xn - 1
C
xn + 1
D
x(n+1)
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12