Q1. Illustrate the procedural and non procedural languages? Which of them are simpler to learn and use? Describe your answer.
Q2. Describe the differences between the disjoint and overlapping constraints in the generalization /specialization in the E-R diagram.
Q3. Define the given integrity constraints:
a) Domain
b) Key
c) Entity
d) Referential Integrity
Q4. Describe the fundamental Armstrong Axioms for the functional dependency.
Q5. Distinguish between the physical and logical data independence. Which of them is simple to accomplish?
Q6. Describe the meaning of existential qualifier and universal quantifier in the context of the Relational Algebra with the help of an illustration.