Crowdly
Add to Chrome
INTRO. TO DATABASE MGMT. SYST.
Looking for INTRO. TO DATABASE MGMT. SYST. test answers and solutions? Browse our comprehensive collection of verified answers for INTRO. TO DATABASE MGMT. SYST. at moodlenew.iitd.ac.in.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
A decomposition is lossless if:
Consider a relation R(P, Q, R, S, T, U) with the following functional dependencies:
1. PQ → RST 2. S → U
The candidate key is PQ.
What is the highest normal form this relation satisfies?
A decomposition preserves dependencies if:
Given the following SQL query:
SELECT * FROM Employee WHERE Salary > 50000 AND Department <> 'Finance';
Which of the following Relational Algebra expressions correctly represents this query?
Which of the following functional dependencies prevents a relation from being in BCNF but not in 3NF?
Consider a relation R(P, Q, R, S, T, U) with the following functional dependencies: 1. PQ → R 2. R → S 3. S → TU 4. T → Q
Using the attribute closure method, is PQ → T derivable from the given FDs?
Given a relation R(X, Y, Z, W) with functional dependencies:
- XY → ZW
- Z → Y
Which of the following is a candidate key?