Ch 23: Boyce-Codd Normal Form (BCNF)

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 11 โ€“ 20 of 20 Questions
Page 2 of 2
Q11
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 23๐Ÿท๏ธ 23.1. Physical Record and De-normalizationMedium๐Ÿ”โญ๐Ÿ’ก๐ŸŒŸ๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
Which of the following statements is NOT correct regarding the database design and optimization technique of De-normalization?
  1. A.It is a performance optimization process designed to decrease database query response times.
  2. B.De-normalization is a design technique used to move tables from lower normal forms to higher normal forms.
  3. C.It deliberately reintroduces controlled data redundancy to minimize expensive database joins.
  4. D.It aims to optimize read-heavy physical database performance at the cost of additional storage write-overhead.
Q12
๐Ÿง  Long Problem๐Ÿ“˜ CS403๐Ÿ“‘ Lec 23๐Ÿท๏ธ 23.3. Physical Records and DenormalizationHard๐Ÿ”โญ๐Ÿ’ก๐ŸŒŸ๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
Consider a fully normalized relational database schema in Second Normal Form (2NF) consisting of two tables: - STUDENTS (StudentID, StudentName, ClassID) - CLASSES (ClassID, CourseTitle, Venue) You are asked to perform a 'De-normalization' step to convert these tables back into a single flat First Normal Form (1NF) table under the following 5 Terms and Conditions: 1. Merge all attributes into a single flat relation named STD_CLASS. 2. Retain duplicate ClassID, CourseTitle, and Venue attributes within the student table. 3. The primary key of the new table must be StudentID. 4. Re-introduce the partial functional dependencies into the flat schema. 5. Re-introduce the transitive dependency chain where StudentID determines ClassID, and ClassID determines CourseTitle and Venue. Define the resulting flat table structure and describe the specific update, insertion, and deletion anomalies that are reintroduced by this denormalization.
๐Ÿ’ป sql Snippet
-- De-normalized table with redundancy
CREATE TABLE STD_CLASS (
    StudentID INT PRIMARY KEY,
    StudentName VARCHAR(50),
    ClassID CHAR(5),
    CourseTitle VARCHAR(100),
    Venue VARCHAR(50)
);
Q13
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 23๐Ÿท๏ธ 23.4. Horizontal PartitioningMedium๐Ÿ”โญ๐Ÿ’ก๐ŸŒŸ๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
During physical database partition design, which of the following partitioning techniques reduces the chances of creating unbalanced partitions (data skewing)?
๐Ÿ’ป text Snippet
-- Conceptual Hash Partition allocation:
-- Disk_Location = Hash_Algorithm(PrimaryKey) % Total_Partitions
  1. A.Vertical Partitioning
  2. B.List Partitioning
  3. C.Hash Partitioning
  4. D.Range Partitioning
Q14
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 23๐Ÿท๏ธ 23.4. Horizontal PartitioningMedium๐Ÿ”โญ๐Ÿ’ก๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
Which of the following types of horizontal partitioning reduces the chances of creating unbalanced partitions (data skewing)?
  1. A.Vertical
  2. B.List
  3. C.Hash
  4. D.Range
Q15
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 23๐Ÿท๏ธ 23.1. Physical Record and De-normalizationMedium๐Ÿ”โญ๐Ÿ’ก๐ŸŒŸ๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
Which of the following statements is NOT true regarding the database design technique of De-normalization?
๐Ÿ’ป sql Snippet
-- Normalized 3NF Schema:
-- STUDENTS(StudentID, StudentName, MajorCode)
-- MAJORS(MajorCode, MajorTitle)

-- De-normalized 1NF Schema:
-- STUDENT_FLAT(StudentID, StudentName, MajorCode, MajorTitle)
  1. A.It is the process of attempting to optimize the performance of a database.
  2. B.De-normalization is a technique to move from lower to higher normal forms of database modeling.
  3. C.In de-normalization, it is required to add redundant data.
  4. D.It enhances the overall retrieval performance of the database.
Q16
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 23๐Ÿท๏ธ 23.1. Physical Record and De-normalizationMedium๐Ÿ”โญ๐Ÿ’ก๐ŸŒŸ๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
Which of the following is NOT true about De-normalization?
  1. A.It is the process of attempting to optimize the performance of a database
  2. B.De-normalization is a technique to move from lower to higher normal forms of database modeling
  3. C.In de-normalization it is required to add redundant data.
  4. D.It enhances the performance of DB
Q17
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 23๐Ÿท๏ธ 23.4. Horizontal PartitioningMedium๐Ÿ”โญ๐Ÿ’ก๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
Under physical database schema design, which of the following is NOT generally a target objective of data partitioning and data placement?
  1. A.Reduce transaction workload
  2. B.Balance operational I/O workload across disks
  3. C.Merging different normalized relations
  4. D.Speed up the execution rate of useful database operations
Q18
๐Ÿ“ Short Q๐Ÿ“˜ CS403๐Ÿ“‘ Lec 23๐Ÿท๏ธ 23.4. Horizontal PartitioningMedium๐Ÿ”โญ๐Ÿ’ก๐ŸŒŸ๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
During the physical design phase of denormalization, database designers sometimes partition tables. Give three key reasons or performance benefits of partitioning tables.
Q19
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 23๐Ÿท๏ธ 23.2. Denormalization SituationsMedium๐Ÿ”โญ๐Ÿ’ก๐ŸŒŸ๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
Under physical database storage design and optimization guidelines, physical record clustering is most suitable for which of the following operational situations?
  1. A.Frequently updated relations with highly volatile transactional fields
  2. B.Relatively static relations where files undergo very few updates
  3. C.Relatively deletion-heavy transaction records to avoid empty pointer lists
  4. D.Relatively dynamic records where table schemas change frequently
Q20
โ“ MCQ๐Ÿ“˜ CS403๐Ÿ“‘ Lec 23๐Ÿท๏ธ 23.4. Horizontal PartitioningMedium๐Ÿ”โญ๐Ÿ’ก๐ŸŒŸ๐Ÿ“„๐ŸŽ“VU๐Ÿ›๏ธVU
During physical database design, which of the following horizontal partitioning techniques applies an algorithm to a partitioning key to evenly distribute rows across physical disks, thereby minimizing the risk of unbalanced partitions?
๐Ÿ’ป text Snippet
-- Conceptual Hash Partitioning mapping:
-- Partition_ID = Hash_Function(StudentID) MOD Number_of_Partitions
  1. A.Vertical Partitioning
  2. B.List Partitioning
  3. C.Hash Partitioning
  4. D.Range Partitioning