The questions can come in any order, so make sure you are selecting right option for all questions.
1. Consider the following Student relation
| roll_no | name | age |
|---|---|---|
| 1 | ABC | 15 |
| 2 | PQR | 12 |
| 3 | ABC | 13 |
| 4 | MNO | 12 |
| 5 | DEF | 13 |
(d) All of the mentioned
2. Which type of functional dependency occurs when Q is a subset of P?
(a) Trivial functional dependency
3. Which attribute set is considered a candidate key?
(b) The set whose closure contains all attributes of the relation
4. Which of the following is a type of inference rule in functional dependency?
(d) All of the mentioned
5. What is the primary purpose of functional dependency in DBMS?
(d) All of the mentioned
6. How is attribute closure calculated?
(b) By recursively adding elements that can be functionally determined from the given set
7. If attribute B is functionally dependent on attribute A, how is it represented?
(a) A -> B
8. In the context of functional dependencies, what is the left-hand side of an arrow (->) called?
(b) Determinant attribute
9. What is the purpose of identifying functional dependencies in a relational database?
(b) To normalize the database
10. ________ on relational databases can be determined by using Armstrong's axioms.
(b) Functional Dependencies
11. In a relational database, what does a functional dependency describe?
(b) The relationship between attributes
12. What are the types of functional dependency?
(b) Trivial FD, Non-Trivial FD, Multivalued FD, Transitive FD
13. Given the functional dependencies.
x -> w
x -> y
y -> z
z -> pq
Which of the following does not hold good.
(b) w -> z
14. What advantage does attribute closure provide in database design?
(a) It ensures data consistency by identifying relationships between attributes
15. When is an attribute set considered a super key?
(a) When it contains all attributes of the relation
16. How is a candidate key identified using attribute closure?
(b) By verifying that no subset of its closure functionally determines all attributes of the relation
17. If A -> B and A -> ___ then A -> BC.
(c) C
18. Consider the following Section relation
| Sec_Id | Sec_Name |
|---|---|
| 1 | A |
| 2 | B |
| 3 | C |
| 4 | A |
| 5 | D |
| 6 | B |
(c) Sec_Id → Sec_Name
19. If X is a relation that has attributes P and Q, then their functional dependency would be represented by ____.
(a) ->
20. Which of the following is not a type of inference rule in functional dependency?
(d) None of the mentioned
21. Which type of functional dependency occurs when Q is not a subset of P?
(b) Non-Trivial functional dependency
22. What is attribute closure in a relational database?
(b) The set of attributes that can be functionally determined from a given attribute set
23. If A -> __ then A -> B and A -> C.
(d) A -> BC
24. If ___ -> B and B -> C then A -> C.
(a)
25. In the context of functional dependencies, what is the right-hand side of an arrow (->) called?
(a) Dependent attribute
26. If A -> B then ___ -> BC.
(b) AC
27. Which attributes are considered prime attributes in a relation?
(a) Attributes that are part of any candidate key
28. Consider the following Section relation
| Sec_Id | Sec_Name |
|---|---|
| 1 | A |
| 2 | B |
| 3 | C |
| 4 | A |
| 5 | D |
| 6 | B |
(a) {Sec_Id, Sec_Name} → Sec_Name
(c) {Sec_Id, Sec_Name} → Sec_Id
29. If A -> B and BC -> D then ___.
(c) AC -> D
30. In the functional dependency A -> B, how would you interpret it?
(a) Attribute A determines the value of attribute B