Q1. Define the terms database, database schema, database instance and the database model.
Q2. Illustrate the terms primary key, candidate key, super key and the foreign key.
Q3. Validate the given statements:
a) Relation must encompass a key.
b) Weak entities don’t encompass their own key attributes.
Q4. Validate the given statements:
a) Every recoverable schedule is the cascade less schedule
b) A relation in BCNF is as well in 3NF
Q5. Write down the merits and demerits of the distributed databases.
Q6. Calculate the closure of the given set F of functional dependencies for relation schema R = (A, B, C, D, E).
A →BC
CD →E
B→ D
E→ A
List out the candidate keys for R.