QCE Digital Solutions Unit 2 Word Scramble: Data and Programming Techniques (Modules 234–285)
Name:
Date:
Class:
🔤
Word scramble
Unscramble the letters and write each key term on the line.
1
ATPLE(KB, EFLID, KF)
A relational schema lists each table and its fields, marks the primary key (underlined) and foreign keys (FK), and shows how tables link.
2
OAMITLNSRAION
Organising tables to reduce repeated data and prevent anomalies by splitting data into linked tables, using the normal forms 1NF to 3NF.
3
TFRSI LORNAM ORFM (FN1)
A table is in 1NF when every field holds one atomic value, there are no repeating groups or repeating columns, and each row is identified by a key.
4
N2F
Second normal form: the table is in 1NF and every non-key field depends on the WHOLE primary key, so no field depends on only part of a composite key. Move partial fields to their own table.
5
N3F
Third normal form: the table is in 2NF and no non-key field depends on another non-key field (no transitive dependency), e.g. suburb depends on postcode, so move it to its own table.
6
F1N, FN2, N3F
Work through 1NF, 2NF, then 3NF, splitting data into new tables linked by foreign keys so no data is lost and anomalies are removed.
7
FI DAVLI = ETRU HTNE
Only insert the record if every validation check left the valid flag true. If any check set valid to false, skip the bad record or report it instead of inserting it.
8
RFO CAHE IENL NI LFIE
A loop that reads each line, splits it into fields, trims and validates them, then builds an INSERT statement for each good row and counts accepted and rejected rows.
9
TRPAEE ... TIULN HOIECC = 4
A menu loop: repeat shows the menu, reads the choice, picks an action with if or else if, and stops on the exit choice. Any other value gets an invalid choice message.
Answer Key
QCE Digital Solutions Unit 2 · Modules 234–285
1ATPLE(KB, EFLID, KF) → Table(PK, field, FK) — A relational schema lists each table and its fields, marks the primary key (underlined) and foreign keys (FK), and shows how tables link.
2OAMITLNSRAION → normalisation — Organising tables to reduce repeated data and prevent anomalies by splitting data into linked tables, using the normal forms 1NF to 3NF.
3TFRSI LORNAM ORFM (FN1) → First normal form (1NF) — A table is in 1NF when every field holds one atomic value, there are no repeating groups or repeating columns, and each row is identified by a key.
4N2F → 2NF — Second normal form: the table is in 1NF and every non-key field depends on the WHOLE primary key, so no field depends on only part of a composite key. Move partial fields to their own table.
5N3F → 3NF — Third normal form: the table is in 2NF and no non-key field depends on another non-key field (no transitive dependency), e.g. suburb depends on postcode, so move it to its own table.
6F1N, FN2, N3F → 1NF, 2NF, 3NF — Work through 1NF, 2NF, then 3NF, splitting data into new tables linked by foreign keys so no data is lost and anomalies are removed.
7FI DAVLI = ETRU HTNE → if valid = true then — Only insert the record if every validation check left the valid flag true. If any check set valid to false, skip the bad record or report it instead of inserting it.
8RFO CAHE IENL NI LFIE → for each line in file — A loop that reads each line, splits it into fields, trims and validates them, then builds an INSERT statement for each good row and counts accepted and rejected rows.
9TRPAEE ... TIULN HOIECC = 4 → repeat ... until choice = 4 — A menu loop: repeat shows the menu, reads the choice, picks an action with if or else if, and stops on the exit choice. Any other value gets an invalid choice message.