1
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider a selection of the form σA ≤ 100(r), where r is a relation with 1000 tuples. Assume that the attribute values for A among the tuples are uniformly distributed in the interval [ 0, 500 ]. Which one of the following options is the best estimate of the number of tuples returned by the given selection query?
2
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the relation employee(name, sex, supervisorName) with name as the key, supervisorName gives the name of the supervisor of the employee under consideration. What does the following Tuple Relational Calculus query produce?
$$\eqalign{ & \{ e.name\,|\,employee(e) \wedge \cr & (\forall x)[\neg employee(x) \vee \cr & x.\sup ervisorName \ne e.name\, \vee \cr & x.sex = 'male']\} \cr} $$3
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Information about a collection of students is given by the relation studInfo(studId, name, sex). The relation enroll(studId, courseId) gives which student has enrolled for (or taken) what course(s). Assume that every course is taken by at least one male and at least one female student. What does the following relational algebra expression represent?
$$\eqalign{ & \prod\nolimits_{courseId} {((\prod\nolimits_{studId} {({\sigma _{sex = 'female'}}} } \cr & (studInfo)) \times \prod\nolimits_{courseId} {(enroll)) - enroll)} \cr} $$4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the table employee(empId, name, department, salary) and the two queries Q1, Q2 below. Assuming that department 5 has more than one employee, and we want to find the employees who get higher salary than anyone in the department 5, which one of the statements is TRUE for any arbitrary employee table?
Q1:
Select e.empId
From employee e
Where not exists
(Select * From employee s
where s.department = "5" and
s.salary >=e.salary);
Q2:
Select e.empId
From employee e
Where e.salary > Any
( Select distinct salary
From employee s
Where s.department = "5");
Paper Analysis
Total Questions
Algorithms 12
Compiler Design 5
Computer Networks 10
Computer Organization 5
Data Structures 13
Database Management System 11
Digital Logic 5
Discrete Mathematics 20
Operating Systems 9
Programming Languages 1
Theory of Computation 7
More Papers of GATE CSE
GATE CSE 2026 Set 2 GATE CSE 2026 Set 1 GATE CSE 2025 Set 2 GATE CSE 2025 Set 1 GATE CSE 2024 Set 2 GATE CSE 2024 Set 1 GATE CSE 2023 GATE CSE 2022 GATE CSE 2021 Set 2 GATE CSE 2021 Set 1 GATE CSE 2020 GATE CSE 2019 GATE CSE 2018 GATE CSE 2017 Set 2 GATE CSE 2017 Set 1 GATE CSE 2016 Set 2 GATE CSE 2016 Set 1 GATE CSE 2015 Set 3 GATE CSE 2015 Set 2 GATE CSE 2015 Set 1 GATE CSE 2014 Set 1 GATE CSE 2014 Set 2 GATE CSE 2014 Set 3 GATE CSE 2013 GATE CSE 2012 GATE CSE 2011 GATE CSE 2010 GATE CSE 2009 GATE CSE 2008 GATE CSE 2007 GATE CSE 2006 GATE CSE 2005 GATE CSE 2004 GATE CSE 2003 GATE CSE 2002 GATE CSE 2001 GATE CSE 2000 GATE CSE 1999 GATE CSE 1998 GATE CSE 1997 GATE CSE 1996 GATE CSE 1995 GATE CSE 1994 GATE CSE 1993 GATE CSE 1992 GATE CSE 1991 GATE CSE 1990 GATE CSE 1989 GATE CSE 1988 GATE CSE 1987
GATE CSE Papers
All year-wise previous year question papers
2023
2022
2020
2019
2018
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