Ch 19: Introduction to Normalization

First final-term module exploring systematic database decomposition to eliminate anomalous side effects during routine transactional updates.

5 Questions5 MCQs0 Short Questions0 Long Questions

🎯 Exam Practice Papers

CS403 - Database Management Systems Examination Practice

Timed practice exam simulation for CS403 - Database Management Systems.

Showing 1 – 5 of 5 Questions

Page 1 of 1

❓ MCQ📘 CS403📑 Lec 19🏷️ 19.2. Full, Partial and Transitive DependenciesMedium🔁⭐💡🌟📄🎓VU🏛️VU

In functional dependency theory, if a single attribute functionally determines all other attributes within a database relation, then that attribute is considered to be at least which of the following?

💻 text Snippet

stId --> (stName, stAdr, prName, credits)

A.Secondary key
B.Relational key
C.Super key
D.Random key

📝 Short Q📘 CS403📑 Lec 19🏷️ 19.5. First Normal Form (1NF)Medium🔁⭐💡🌟📄🎓VU🏛️VU

You are given the following unnormalized database table with multi-valued (non-atomic) entries: STUDENT Table: | stId | stName | stAdr | prName | bkId | |---|---|---|---|---| | S1015 | Tahira Ejaz | Wah | MCS | B08945, B06352 | Explain why this table violates the First Normal Form (1NF) and show the correct 1NF conversion.

💻 text Snippet

Unnormalized Table:
STUDENT(stId, stName, stAdr, prName, bkId)
Tahira Ejaz has: bkId = 'B08945, B06352'

❓ MCQ📘 CS403📑 Lec 19🏷️ 19.5. First Normal Form (1NF) and Atomic ValuesMedium🔁⭐💡📄🎓VU🏛️VU

Consider the un-normalized database table 'STUDENT_HOBBIES' which has the schema '(StudentID, StudentName, Hobbies)'. Row S1015 contains multiple values in the 'Hobbies' column: '(S1015, 'Tahira Ejaz', 'Reading, Cycling')'. What is the correct structural process to convert this table into First Normal Form (1NF)?

💻 text Snippet

-- Violation of 1NF (Multi-valued non-atomic field):
-- S1015, 'Tahira Ejaz', 'Reading, Cycling'

A.Flatten the multi-valued attribute by splitting the hobbies into individual, distinct rows (tuples) so that every field cell contains only atomic values.
B.Decompose the table by removing the 'Hobbies' column entirely and adding it as a primary key constraint to a separate table.
C.Convert the 'Hobbies' column data type from VARCHAR to a multi-dimensional array data type to allow nested rows.
D.Maintain the existing flat row structure and designate both 'StudentID' and 'Hobbies' as a composite foreign key.

❓ MCQ📘 CS403📑 Lec 19🏷️ 19.3. Inference Rules (Armstrong's Axioms)Hard🔁⭐💡🌟📄🎓VU🏛️VU

Armstrong's axioms are a set of inference rules used to derive all logical functional dependencies (FDs) in a database relation. Which of the following correctly describes the three primary (reflexive, augmentation, and transitive) inference rules?

💻 text Snippet

-- Armstrong's Axioms:
-- 1. Reflexivity: If Y ⊆ X, then X -> Y
-- 2. Augmentation: If X -> Y, then XZ -> YZ
-- 3. Transitivity: If X -> Y and Y -> Z, then X -> Z

A.Reflexivity: If Y is a subset of X, then X determines Y. Augmentation: If X determines Y, then XZ determines YZ. Transitivity: If X determines Y and Y determines Z, then X determines Z.
B.Reflexivity: If X determines Y, then Y determines X. Augmentation: If X determines Y, then X determines YZ. Transitivity: If X determines Y and Z determines Y, then X determines Z.
C.Reflexivity: If X is a subset of Y, then X determines Y. Augmentation: If X determines Y, then XZ determines Y. Transitivity: If X determines Y and Z determines Y, then X determines Z.
D.Reflexivity: If X determines Y, then X must be the primary key. Augmentation: If X determines Y, then X must be a composite key. Transitivity: If X is transited to another table, Y becomes a foreign key.

❓ MCQ📘 CS403📑 Lec 19🏷️ 19.3. Inference Rules (Armstrong's Axioms)Hard🔁⭐💡🌟📄🎓VU🏛️VU

Consider the following two functional dependency derivations within a relation schema: Code 1: If stId -> stName, then {stId, ClassID} -> {stName, ClassID}. Code 2: If stId -> ClassID and ClassID -> Venue, then stId -> Venue. Which of Armstrong's Axioms (inference rules) are applied in Code 1 and Code 2 respectively?

💻 text Snippet

Code 1: If X -> Y, then XZ -> YZ
Code 2: If X -> Y and Y -> Z, then X -> Z

A.Code 1: Augmentation Rule; Code 2: Transitivity Rule
B.Code 1: Reflexivity Rule; Code 2: Transitivity Rule
C.Code 1: Augmentation Rule; Code 2: Reflexivity Rule
D.Code 1: Decomposition Rule; Code 2: Union Rule

Ch 19: Introduction to Normalization

CS403 - Database Management Systems Examination Practice

Mid Term Examination

Final Term Examination

CS403 - Database Management Systems Examination Practice

Mid Term Examination

Final Term Examination

📖 Related CS403 - Database Management Systems Curriculum Units