Database Management System
Er Diagrams
Marks 1Marks 2
Functional Dependencies and Normalization
Marks 1Marks 2
Structured Query Language
Marks 1Marks 2
Relational Algebra
Marks 1Marks 2
Transactions and Concurrency
Marks 1Marks 2
File Structures and Indexing
Marks 1Marks 2
1
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Let R and S be two relations with the following schema

R (P, Q, R1, R2, R3)

S (P, Q, S1, S2)

Where {P, Q} is the key for both schemas. Which of the following queries are equivalent?
I. $$\Pi_P \left(R \bowtie S\right)$$
II. $$\Pi_P \left(R\right) \bowtie \Pi_P\left(S\right)$$
III. $$\Pi_P \left(\Pi_{P, Q} \left(R\right) \cap \Pi_{P,Q} \left(S\right) \right)$$
IV. $$\Pi_P \left(\Pi_{P, Q} \left(R\right) - \left(\Pi_{P,Q} \left(R\right) - \Pi_{P,Q} \left(S\right)\right)\right)$$
A
Only I and II
B
Only I and III
C
Only I, II and III
D
Only I, III and IV
2
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the following relation schemas :

b-Schema = (b-name, b-city, assets)
a-Schema = (a-num, b-name, bal)
d-Schema = (c-name, a-number)

Let branch, account and depositor be respectively instances of the above schemas. Assume that account and depositor relations are much bigger than the branch relation.

Consider the following query:
Пc-nameb-city = “Agra” ⋀ bal < 0 (branch $$ \Join $$ (account $$ \Join $$ depositor))

Which one of the following queries is the most efficient version of the above query ?

A
Пc-namebal < 0b-city = “Agra” branch $$ \Join $$ account) $$ \Join $$ depositor)
B
Пc-nameb-city = “Agra”branch $$ \Join $$ (σbal < 0 account $$ \Join $$ depositor))
C
Пc-nameb-city = “Agra” branch $$ \Join $$ σb-city = “Agra” ⋀ bal < 0 account) $$ \Join $$ depositor)
D
Пc-nameb-city = “Agra” ⋀ bal < 0 account $$ \Join $$ depositor))
3
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} $$
A
Names of employees with a male supervisor.
B
Names of employees with no immediate male subordinates.
C
Names of employees with no immediate female subordinates.
D
Names of employees with a female supervisor.
4
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} $$
A
Courses in which all the female students are enrolled.
B
Courses in which a proper subset of female students are enrolled.
C
Courses in which only male students are enrolled.
D
None of the above.
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