1
GATE CSE 2003
+1
-0.3
Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal sequence of the resultant tree?
A
7 5 1 0 3 2 4 6 8 9
B
0 2 4 3 1 6 5 9 8 7
C
0 1 2 3 4 5 6 7 8 9
D
9 8 6 4 2 3 0 1 5 7
2
GATE CSE 2003
+2
-0.6
Consider the following functional dependencies in a database.
\eqalign{ & \,\,\,\,Date\,\,of\,\,Birth\,\, \to \,\,Age \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,Age\,\, \to \,\,Eligibility \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,Name\,\, \to \,\,Roll\_number \cr & \,\,\,\,\,Roll\_number\,\, \to \,\,Name \cr & Course\_number\, \to \,\,Course\_name \cr & Course\_number\, \to Instructor \cr & (Roll\_Number,\,Course\_number)\,\, \to \,\,Grade \cr}

The relation (Roll_number, Name, Date_of_Birth, Age) is

A
In $$2$$ $$NF$$ but not in $$3$$ $$NF$$
B
In $$3$$ $$NF$$ but not in $$BCNF$$
C
In $$BCNF$$
D
None of the above
3
GATE CSE 2003
+2
-0.6
Consider the set of relations shown below and the SQL query that follows.

Students: (Roll_number, Name, Date_of_birth)
Courses: (Course number, Course_name, Instructor)

Select distinct Name
and Courses.Instructor = 'Korth'
Which of the following sets is computed by the above query?
A
Names of students who have got an A grade in all courses taught by Korth
B
Names of students who have got an A grade in all courses
C
Names of students who have got an A grade in at least one of the courses taught by Korth
D
None of the above
4
GATE CSE 2003
+1
-0.3
Consider the following SQL query:
Select distinct a1, a2, ..., an

From r1, r2, ..., rm

Where P;
For an arbitrary predicate P, this query is equivalent to which of the following relational algebra expressions?
A
$$\prod\limits_{{a_1},{a_2},....,{a_n}} {{\sigma _p}} \left( {{r_1} \times {r_2} \times .... \times {r_m}} \right)$$
B
$$\prod\limits_{{a_1},{a_2},....,{a_n}} {{\sigma _p}} \left( {{r_1} \Join {r_2} \Join .... \Join {r_m}} \right)$$
C
$$\prod\limits_{{a_1},{a_2},....,{a_n}} {{\sigma _p}} \left( {{r_1} \cup {r_2} \cup .... \cup {r_m}} \right)$$
D
$$\prod\limits_{{a_1},{a_2},....,{a_n}} {{\sigma _p}} \left( {{r_1} \cap {r_2} \cap .... \cap {r_m}} \right)$$
GATE CSE Papers
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987
EXAM MAP
Joint Entrance Examination