Time Left - 12:00 mins
GATE CS 2019 - Database(SQL ) Quiz-2 (App update required to attempt this test)
Attempt now to get your rank among 400 students!
Question 1
A relation R(A,B,C,D,E,F) holds the following FDs.
AB→C
C→D
D→EA
E→F
F→B
Find the number candidate keys of R.
AB→C
C→D
D→EA
E→F
F→B
Find the number candidate keys of R.
Question 2
Consider the relation scheme of the relation SCHEDULE shown below. What is the highest Normal form of this relation?
SCHEDULE (Stud_ID, Class, Stud_Name, Stud_Major, Class_Time, Building_Room, Instructor)
Assume the following functional dependencies
Stud_ID →Stud_Name
Stud_ID →Stud_Major
Class →Class_Time
Class →Building_Room
Class →Instructor
SCHEDULE (Stud_ID, Class, Stud_Name, Stud_Major, Class_Time, Building_Room, Instructor)
Assume the following functional dependencies
Stud_ID →Stud_Name
Stud_ID →Stud_Major
Class →Class_Time
Class →Building_Room
Class →Instructor
Question 3
Which of the following is NOT a super key in a relational schema with attributes V, W , X , Y , Z and primary key V Y ?
Question 4
Given a relation R with four attributes A, B, C and D. The following functional dependencies holds for R.
Identify the highest normal form that R satisfies.
Identify the highest normal form that R satisfies.
Question 5
The term physical data independence is defined as:
Question 6
Consider a relation R{ABCDEFGH}
Consider the following FD’s linked to it:
6) A -> BC
7) E -> A
8) F -> EG
9) B -> CFH
10) CH -> G
How many candidate keys exist for the relation R?
Consider the following FD’s linked to it:
6) A -> BC
7) E -> A
8) F -> EG
9) B -> CFH
10) CH -> G
How many candidate keys exist for the relation R?
- 400 attempts
- 4 upvotes
- 4 comments
Tags :
GATE & PSU CSDatabasesApr 1GATE & PSU CS