Ch 05: Database Data Models

20 Questions20 MCQs0 Short Questions0 Long Questions
๐ŸŽฏ Exam Practice Papers
SEMESTER PASS

CS403 - Database Management Systems Examination Practice

Timed practice exam simulation for CS403 - Database Management Systems.

๐Ÿ“˜ VU MID TERM EXAMLectures 1 to 22
โฑ๏ธ 60 Mins

Mid Term Examination

Covers syllabus of Lectures 1 to 22 with 30 high-yield MCQs in a timed exam environment.

๐Ÿ“30 MCQs
โฑ๏ธ60 Minutes
๐Ÿ“— VU FINAL TERM EXAMLectures 23 to 45
โฑ๏ธ 90 Mins

Final Term Examination

Comprehensive semester exam preparation with 45 MCQs covering Lectures 23 to 45 with complete course coverage.

๐Ÿ“45 MCQs
โฑ๏ธ90 Minutes
Showing 1 โ€“ 10 of 20 Questions
Page 1 of 2
Q1
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 5๐Ÿท๏ธ 05.5. DFD SymbolsEasy๐Ÿ”โญ๐Ÿ’ก๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
Which of the following is NOT a valid component of a Data Flow Diagram (DFD)?
  1. A.Dataflow
  2. B.Datastore
  3. C.External entities
  4. D.Relationship between external entities
Q2
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 5๐Ÿท๏ธ 05.5. DFD SymbolsEasy๐Ÿ”โญ๐Ÿ’ก๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
Which of the following graphical diagrams uses specific symbols to indicate the sequential flow of a procedure or system algorithm being explained?
  1. A.Entity Relationship Diagram
  2. B.Data Flow Diagram (DFD)
  3. C.Flowchart
  4. D.State Diagram
Q3
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 5๐Ÿท๏ธ 5.1. Database Normalization and Functional DependenciesEasy๐Ÿ”โญ๐Ÿ’ก๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
Desirable properties of relational database design include ________.
  1. A.minimizing insertion/deletion anomalies
  2. B.minimizing redundancy
  3. C.minimizing update anomalies
  4. D.all of the above
Q4
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 5๐Ÿท๏ธ 5.1. Database Normalization and Functional DependenciesEasy๐Ÿ”โญ๐Ÿ’ก๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
Which of the following are essential and desirable properties of a good relational database schema design during relation decomposition?
  1. A.Lossless-join property and dependency preservation
  2. B.Maximum redundancy and insertion anomalies
  3. C.Unbound null values and update anomalies
  4. D.Deletion anomalies and lossy joins
Q5
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 5๐Ÿท๏ธ 5.1. Database Normalization and Functional DependenciesEasy๐Ÿ”โญ๐Ÿ’ก๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
The functional dependency A -> B for a relation schema R(A, B, C, D) implies that ________.
๐Ÿ’ป sql Snippet
t1[A] = t2[A] => t1[B] = t2[B]
  1. A.any two tuples in R that have the same value for A must have the same value for B
  2. B.no two tuples in R can have the same value for attribute B
  3. C.no two tuples in R can have the same value for attribute A
  4. D.any two tuples in R that have the same value for B must have the same value for A
Q6
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 5๐Ÿท๏ธ 5.1. Database Normalization and Functional DependenciesMedium๐Ÿ”โญ๐Ÿ’ก๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
If AB -> CD is a functional dependency for relation schema R(A, B, C, D), which of the following statements will always hold?
๐Ÿ’ป sql Snippet
{A, B}+ = {A, B, C, D}
  1. A.AB is a candidate key for R
  2. B.no two tuples in R can have the same values for A and B
  3. C.AB is a primary key for R
  4. D.all of the above
Q7
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 5๐Ÿท๏ธ 5.1. Database Normalization and Functional DependenciesEasy๐Ÿ”โญ๐Ÿ’ก๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
Given the functional dependencies {AB -> C, C -> D} for relation schema R(A, B, C, D), the inferred dependency AB -> D is derived using which Armstrong inference rule?
๐Ÿ’ป sql Snippet
AB -> C, C -> D => AB -> D
  1. A.The transitive rule
  2. B.The reflexive rule
  3. C.The augmentation rule
  4. D.None of the above
Q8
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 5๐Ÿท๏ธ 5.1. Database Normalization and Functional DependenciesMedium๐Ÿ”โญ๐Ÿ’ก๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
Given the set of functional dependencies {AB -> CDE, A -> E} for relation schema R(A, B, C, D, E), which of the following can be inferred?
๐Ÿ’ป sql Snippet
{A, B}+ = {A, B, C, D, E}
  1. A.AB is a key for R
  2. B.A is a key for R
  3. C.BE is a key for R
  4. D.None of the above
Q9
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 5๐Ÿท๏ธ 5.1. Database Normalization and Functional DependenciesEasy๐Ÿ”โญ๐Ÿ’ก๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
Consider the table (Relation) CARS with schema CARS(REGNO, MODEL, COLOUR, OID), where REGNO is the single-attribute primary key and OID is a foreign key identifying the car's owner. In which highest normal form is this table?
๐Ÿ’ป sql Snippet
CARS(REGNO, MODEL, COLOUR, OID)
  1. A.third normal form
  2. B.second normal form
  3. C.first normal form
  4. D.cannot be determined
Q10
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 5๐Ÿท๏ธ 5.1. Database Normalization and Functional DependenciesEasy๐Ÿ”โญ๐Ÿ’ก๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
In relational database normalization, which normal form strictly prohibits transitive dependencies on non-prime attributes?
๐Ÿ’ป sql Snippet
FD: X -> Y and Y -> Z (where Y is non-prime) => Violates 3NF
  1. A.third normal form
  2. B.second normal form
  3. C.first normal form
  4. D.none of the above