1
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
2
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 ).
3
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Which normal form is considered adequate for normal relational database design?
A
$$2$$ $$NF$$
B
$$5$$ $$NF$$
C
$$4$$ $$NF$$
D
$$3$$ $$NF$$
4
GATE CSE 1998
Subjective
+2
-0

Suppose we have a database consisting of the following three relations.

FREQUENTS (student, parlor) giving the parlors each student visits.

SERVES (parlor, ice-cream) indicating what kind of ice-creams each parlor serves.

LIKES (student, ice-cream) indicating what ice-creams each student likes.

(Assume that each student likes at least one ice-cream and frequents at least one parlor)

Express the following in SQL:
Print the students that frequent at least one parlor that serves some ice-cream that they like.