Design a relational database using Entity‑Relationship (ER) modelling.
Distinguish between conceptual and logical ER diagrams and map each element to the Cambridge AS/A‑Level IT 9626 syllabus.
Normalise a database up to Third Normal Form (3NF) and explain the advantages of each normal form.
Produce a complete data‑dictionary for the designed database.
Explain file‑management concepts, the main types of DBMS and their advantages/disadvantages.
Implement validation, verification and error‑checking mechanisms.
Design a data‑entry form, a switchboard/menu and basic reports.
Import and export data using common file formats (CSV, TXT, RTF).
1. Creating a database – overview (10.1)
Gather requirements from users and stakeholders.
Identify **entities**, **attributes**, **primary keys (PK)** and **foreign keys (FK)**.
Define relationships, cardinalities and any integrity constraints.
Draw a conceptual ER diagram – a high‑level business view.
Refine to a logical ER diagram** – ready for implementation (includes all attributes, PK/FK notation and data‑type hints).
Normalise the logical model to 3NF.
Produce a data‑dictionary.
Choose an appropriate DBMS and file‑management strategy.
Design data‑entry forms, switchboard/menu and reports.
Implement validation, verification and error‑checking.
Import and export data (CSV, TXT, RTF).
2. Entity‑Relationship modelling
2.1 Conceptual ER diagram
Shows only the essential entities, primary keys and relationships.
Attributes are limited to those required to understand the business rules.
Notation (Cambridge‑recommended):
Rectangle = entity.
Diamond = relationship.
Lines with cardinality symbols (1, 0..1, 1..N, N) or crow‑foot notation.
2.2 Logical ER diagram
All attributes for each entity are listed inside the entity rectangle.
Primary keys are underlined; foreign keys are identified (FK).
Data types may be noted as a side comment (e.g., VARCHAR(30), INT).
Repeating groups, partial and transitive dependencies have been removed (i.e. the diagram is already normalised).
2.3 Referential integrity
Referential integrity guarantees that a foreign‑key value always matches an existing primary‑key value in the referenced table. It prevents orphan records and maintains consistency across related tables. In most relational DBMSs it is enforced by defining FK constraints (e.g., ON DELETE CASCADE or ON UPDATE RESTRICT).
2.4 Mapping ER‑diagram elements to the syllabus (10.1)
All attributes listed, PK underlined, FK marked, data‑type notes added.
3. Normalisation to Third Normal Form (10.2)
3.1 Why normalise?
Eliminate data redundancy.
Reduce update, insertion and deletion anomalies.
Make the database easier to maintain and extend.
Improve query performance when proper indexes are used.
3.2 Normalisation steps – worked example
Stage
Structure (sample data)
Key characteristics
Un‑normalised table (UNF)
StudentID | StudentName | CourseCodes | Grades
-----------------------------------------------------------------
001 | Alice | CS101, MA102 | A, B
002 | Bob | CS101 | B
Repeating group – multiple CourseCodes/Grades per student.
First Normal Form (1NF)
StudentID | StudentName | CourseCode | Grade
------------------------------------------------
001 | Alice | CS101 | A
001 | Alice | MA102 | B
002 | Bob | CS101 | B
Atomic values only; each row contains a single value for every attribute.
Second Normal Form (2NF)
-- Student table
StudentID | StudentName
-------------------------
001 | Alice
002 | Bob
-- Enrolment table
EnrolmentID | StudentID | CourseCode | Grade
---------------------------------------------
E001 | 001 | CS101 | A
E002 | 001 | MA102 | B
E003 | 002 | CS101 | B
All non‑key attributes fully depend on the whole primary key (no partial dependencies).
Your generous donation helps us continue providing free Cambridge IGCSE & A-Level resources,
past papers, syllabus notes, revision questions, and high-quality online tutoring to students across Kenya.