GATE CS & IT RDBMS PYQs Analysis
GATE CS & IT RDBMS PYQs Analysis
1
(d) Both S1 and S2 are false (d) Both S1 and S2 are FALSE
1.1 1.2
GATE Wallah CS & IT Topic wise PYQs GATE Wallah CS & IT Topic wise PYQs
Database Design and ER Model Database Management System
(a) Relationship R is one-to-many and the (c) In a row of a relational table, an attribute can have
participation of A in R is total. more than one value.
(b) Relationship R is one-to-many and the (d) In a row of a relational table, an attribute can have
participation of A in R is partial. exactly one value or a NULL value.
(c) Relationship R is many-to-one and the 1. (a) 2. (19 to 19) 3. (b) 4. (a)
participation of A in R is total. 13. [MCQ] [GATE-2008 : 2M] 5. (d) 6. (0 to 0) 7. (d) 8. (a)
(d) Relationship R is many-to-one and the Consider the following ER diagram 9. (a) 10. (c) 11. (4 to 4) 12. (c)
participation of A in R is partial. 13. (b) 14. (a)
1.3 1.4
GATE Wallah CS & IT Topic wise PYQs GATE Wallah CS & IT Topic wise PYQs
Database Design and ER Model Database Management System
9. (a)
By default foreign key references to the primary key E1 (a11 a12) a11 a12
of referenced relation. E2 (a21 a22) a21 a22
1.5 1.6
GATE Wallah CS & IT Topic wise PYQs GATE Wallah CS & IT Topic wise PYQs
Database Design and ER Model Design of springs
2
So, R is in 3NF
Minimum 4 table required
1.7 1.8
GATE Wallah CS & IT Topic wise PYQs GATE Wallah CS & IT Topic wise PYQs
Functional Dependency and Normalization Database Management System
Minimal Cover X = (PQRS). X is not in BCNF. Suppose X is (a) R has a non-trivial functional dependency Which one of the relational schemas above is in 3 NF
decomposed into two schemas Y and Z, where Y = (P X A, where X is not a superkey and A is a but not in BCNF?
8. [MCQ] [GATE-2017 : 2M] R) and Z = (Q R S). prime attribute. (a) Schema I (b) Schema II
The following functional dependencies hold true for Consider the two statements given below. (b) R has a non-trivial functional dependency (c) Schema III (d) Schema IV
the relational schema R {V, W, X, Y, Z}: I. Both Y and Z are in BCNF X A, where X is not a superkey and A is a non-
[V W; VW X; Y VX; Y Z] II. Decomposition of X into Y and Z is dependency prime attribute and X is not a proper subset of any 15. [MCQ] [GATE-2014 : 2M]
preserving and lossless key.
Which of the following is irreducible equivalent for Given the following two statements:
Which of the above statements is/are correct? (c) R has a non-trivial functional dependency
this set of functional dependencies?
(a) Both I and II (b) I only S1: Every table with two single-valued attributes is in
(a) (b) X A, where X is not a superkey and A is a non-
(c) II only (d) Neither I nor II 1 NF, 2 NF, 3 NF and BCNF.
prime attribute and X is a proper subset of some
key. S2: AB C, D E, E C is a minimal cover for
11. [MCQ] [GATE-2008 : 2M] (d) A cell in R holds a set instead of an atomic value. the set of functional dependencies AB C,
Let R(A, B, C, D) be a relational schema with the D E, AB E, E C.
(c) (d) following functional dependencies: 14. [MCQ] [GATE-2018 : 2M] Which one of the following is CORRECT?
A B, B C, C D and D B Consider the following four relational schemas. For (a) S1 is TRUE and S2 is FALSE.
The decomposition of R into (A, B),(B, C), (B, D) each schema, all non-trivial functional dependencies (b) Both S1 and S2 are TRUE.
(a) Gives a lossless join, and is dependency are listed. The underlined attributes are the respective
(c) S1 is FALSE and S2 TRUE.
preserving primary keys.
(b) Gives a lossless join, but is not dependency (d) Both S1 and S2 are FALSE.
Schema I:
preserving Registration (rollno, courses)
Properties of Decomposition (c) Does not give a lossless join, but is dependency 16. [MCQ] [GATE-2013 : 2M]
Field 'courses' is a set-valued attribute containing the
9. [MCQ] [GATE-2021 : 2M] preserving Relation R has eight attributes ABCDEFGH.
set of courses a student has registered for.
(d) Does not give a lossless join and is not Fields of R contain only atomic values.
Consider the relation R(P, Q, S, T, X, Y, Z, W) with Non-trivial functional dependency:
dependency preserving.
the following functional dependencies F = {CH G, A BC, B CFH, E A, F E
rollno courses
PQ X;P YX ; Q Y;Y ZW G} is a set of functional dependencies (FDs) so that
Normal Form Schema II:
Consider the decomposition of the relation R into the F+ is exactly the set of FDs that hold for R.
Registration (rollno, courseid, email)
constituent relations according to the following two 12. [MCQ] [GATE-2022 : 1M] The relation R is
Non-trivial functional dependencies:
decomposition schemes In a relational data model, which one of the following (a) in 1 NF, but not in 2 NF.
D1: R = [(P, Q, S, T); (P, T, X); (Q, Y); (Y, Z, W)] statements is TRUE? rollno, courseid email
(b) in 2 NF, but not in 3 NF.
D2: R = [(P, Q, S); (T, X); (Q, Y); (Y, Z, W)] (a) A relation with only two attributes is always in email rollno
(c) in 3 NF, but not in BCNF.
BCNF. Schema III:
Which one of the following options is correct? (d) in BCNF.
(b) If all attributes of a relation are prime attributes, Registration (rollno, courseid, marks, grade)
(a) D1 is a lossless decomposition, but D2 is a lossy
then the relation is in BCNF.
decomposition. Non-trivial functional dependencies: 17. [MCQ] [GATE-2012 : 1M]
(c) Every relation has at least one non-prime
(b) D1 is a lossy decomposition, but D2 is a lossless rollno, courseid marks, grade
attribute. Which of the following is TRUE?
decomposition.
(d) BCNF decompositions preserve functional marks grade (a) Every relation in 3 NF is also in BCNF
(c) Both D1 and D2 are lossless decompositions.
dependencies. Schema IV: (b) A relation R is in 3 NF if every non-prime
(d) Both D1 and D2 are lossy decompositions.
Registration (rollno, courseid, credit) attribute of R is fully functionally dependent on
13. [MCQ] [GATE-2020 : 2M] every key of R
10. [MCQ] [GATE-2019 : 2M] Non-trivial functional dependencies:
Consider a relational table R that is in 3 NF, but not in
Let the set of functional dependencies F = {QR S, rollno, courseid credit (c) Every relation in BCNF is also in 3 NF
BCNF. Which one of the following statements is
R P, S Q} hold on a relation schema courseid credit (d) No relation can be in both BCNF and 3 NF
TRUE?
1.9 1.10
GATE Wallah CS & IT Topic wise PYQs GATE Wallah CS & IT Topic wise PYQs