Standard difficulty · 20 questions · 40 marks · Time: 39 minutes
Show your working for Sections B and C. Answers are on the last page — try every question first!
Database Concepts · AW-11IP-DBC-2026-V1 · For parents — fold back or tear off before handing the sheet to your child.
| Q | Answer | Working |
|---|---|---|
| 1 | (d) software to create, store, manage and query databases | — |
| 2 | (b) 5 | degree = number of attributes (columns) |
| 3 | (d) 8 | cardinality = number of tuples (rows) |
| 4 | (c) AdmNo | AdmNo has a different value in every row and no NULL |
| 5 | (a) foreign key | — |
| 6 | (d) data redundancy | — |
| 7 | (b) Sana | Sana's GUID is not in GUARDIAN |
| 8 | (c) 3 | alternate keys: AdmNo, RollNo, Phone |
| 9 | Data redundancy (the same data in many files) and data inconsistency (copies that disagree); also data isolation and dependence on file formats. | — |
| 10 | (a) 5; (b) 7; (c) 3 | degree = columns; cardinality = rows; 7 + 1 − 5 |
| 11 | AdmNo | a candidate key has a different, non-NULL value in every row |
| 12 | RollNo, LibraryCardNo, MemberId | every candidate key except the primary key |
| 13 | Bhavna, Manav | look up each GUID in GUARDIAN |
| 14 | (a) 2; (b) 6 | 3 students × 2 dates |
| 15 | 760; 190 | 4 × 190; one per student’s guardian |
| 16 | 2 | A, B |
| 17 | Redundancy and inconsistency (a DBMS stores data once and links tables), data isolation (tables can be joined by keys), data dependence (programs use queries, not file layouts), uncontrolled sharing (a DBMS gives each user only the rights they need). | — |
| 18 | (a) degree 5, cardinality 6; (b) AdmNo, RollNo; (c) RollNo; (d) two students share a name, so Name does not identify a row | unique and non-NULL in every row |
| 19 | (a) GUID; (b) GUID; (c) Tanvi; (d) reject the insertion, because the GUID must already exist in GUARDIAN | a foreign key value must match a primary key value in the referenced table (or be NULL) |
| 20 | (a) No; (b) No; (c) Yes | each date repeats for every student and each roll number for every date; the pair appears once |