DBMS Unit 3

Download as pdf or txt
Download as pdf or txt
You are on page 1of 13

SET - A

Subject Name: 21CS1401 - Database Management System Marks: 25


Each Question Carry ONE Mark
UNIT 3 - DATABASE DESIGN

I. Multiple Choice Questions:

1. Which of the following normal form(s) is / are based on the functional dependencies among the
attributes of a relation?
(i) 1NF (ii) 2NF (iii) 3NF (iv) 4NF
A) Only (i) and (ii)
B) Only (ii) and (iii)
C) (i), (ii) and (iii)
D) More than one of the above
E) None of the above
Answer: C
2. A BCNF is:
A) loss less join and dependency preserving
B) loss less join and but not dependency preserving
C) not loss less join but dependency preserving
D) none of these
Answer: B
3. 5NF is designed to cope with:
A) Transitive dependency
B) Join dependency
C) Multi valued dependency
D) All of the above
Answer: B
4. Given the functional dependencies:
X  W; X  Y, Y  Z and Z  PQ
Which of the following does not hold good?
A) X  Z
B) W  Z
C) X  XY
D) None of these
Answer: B
5. The relational decomposition of a database divides the table into tables.
A) New
B) Two
C) Three
D) Multiple
Answer: D

II. Fill in the Blanks:


1. In the normal form, a composite attribute is converted to individual attributes.
Answer: First
2. Functional dependencies are the types of constraints that are based on .
Answer: key
3. normal form is considered adequate for database design.
Answer: Third
4. The process to properly define the database tables to provide flexibility, minimized redundancy and
data integrity is called .
Answer: Data normalization
5. Anomalies are avoided by splitting the offending relation into multiple relations, is also known as
.
Answer: Decomposition

III. True or False:

1. To avoid modification anomalies in a database, it is better to modify the table design than to work
around them by writing code or using dummy values.
Answer: True
2. 3NF / BCNF is the most important normal form in practice because normal forms higher than this
involve other kinds of dependencies that are less common and more difficult to understand.
Answer: True
3. Using Boyce - Codd Normal form (BCNF) allows you to perform the normalization process in one
step, as opposed to using 2NF and 3NF which requires two normalization steps.
Answer: False
4. Due to the extra joins involved, splitting a table because it has multiple candidate keys can degrade
query performance.
Answer: False
5. Once all of the functional dependencies have been analysed and a table is in BCNF, it is safe to assume
that the table does not contain any redundancies that would cause modification anomalies.
Answer: False

IV. Match the Following:

1. Match the following Normal forms with their functionalities:


1. First Normal Form (1NF) A. Eliminates transitive dependencies
2. Second Normal Form (2NF) B. Eliminates partial dependencies
3. Third Normal Form (3NF) C. No repeating groups
4. Boyce-Codd Normal Form (BCNF) D. Deals with join dependencies
5. Fourth Normal Form (4NF) E. Every determinant is a candidate
key
6. Fifth Normal Form (5NF) F. Eliminates multivalued
dependencies
a, 1 - C, 2 - D, 3 - A, 4 - B, 5 - F, 6 - E
b, 1 - B, 2 - C, 3 - A, 4 - D, 5 - E, 6 - F
c, 1 - B, 2 - C, 3 - A, 4 - E, 5 - F, 6 - D
d, 1 - D, 2 - C, 3 - B, 2 - A, 5 - F, 6 - E
2. Match the following keys with their descriptions:
1. Primary key A. One or more attributes uniquely
identifying a row
2. Candidate key B. Minimal super key
3. Super key C. Unique identifier for a record
4. Foreign key D. References primary key in another
table
a, 1 - D, 2 - B, 3 - C, 4 - A
b, 1 - C, 2 - B, 3 - D, 4 - A
c, 1 - A, 2 - B, 3 - D, 4 - C
d, 1 - C, 2 - B, 3 - A, 4 - D

3. Match the following terms with their descriptions:


A. Breaking relations into smaller
1. Decomposition
ones
2. Dependency preservation B. All dependencies preserved
3. Lossless decomposition C. No data loss after decomposition
4. Schema Refinement D. Process to eliminate redundancy

a, 1 - D, 2 - A, 3 - B, 4 - C
b, 1 - A, 2 - B, 3 - C, 4 - D
c, 1 - D, 2- B, 3 - A, 4 - C
d, 1 - C, 2 - D, 3 - D, 4 - B

4. Match the following dependencies with their characteristics:


1. Functional dependency A. Attribute uniquely determines
another
2. Transitive dependency B. Attribute depends on another
through a third attribute
3. Multivalued dependency C. Attribute depends on multiple
values of another
4. Join dependency D. Generalization of multivalued
dependencies
a, 1 - A, 2 - B, 3 - C, 4 - D
b, 1 - B, 2 - C, 3 - D, 4 - A
c, 1 - C, 2- B, 3 - A, 4 - D
d, 1 - D, 2- C, 3 - B, 4- 1

5. Match the following types of anomalies with their descriptions:


A. Undesirable side effects of
Anomalies
1. redundancy
2. Update Anomalies B. Problems during modification
3. Insertion Anomalies C. Problems during deletion
4. Deletion Anomalies D. Problems during insertion
a, 1 - D, 2 - B, 3 - C, 4 - A
b, 1 - A, 2 - B, 3 - D, 4 - C
c, 1 - C, 2 - D, 3 - B, 4 - A
d, 1 - A, 2 - C, 3 - B, 4 - D
V. Short Answers:

1. What is a primary key?


A unique identifier for a record in a table.
2. What is the purpose of normalization?
To reduce redundancy and eliminate anomalies.
3. What is a functional dependency?
When one attribute uniquely determines another attribute.
4. What is a candidate key?
A minimal super key.
5. What is a super key?
One or more attributes that uniquely identify a row in a table.
SET - B

Subject Name: 21CS1401 - Database Management System Marks: 25


Each Question Carry ONE Mark
UNIT 3 - DATABASE DESIGN

I. Multiple Choice Questions:

1. What is the main goal of normalization?


A) Increase redundancy
B) Reduce anomalies
C) Increase data duplication
D) Reduce data integrity
Answer: B
2. A functional dependency A  B implies:
A) B determines A
B) A determines B
C) A and B are independent
D) None of the above
Answer: B
3. Which of the following is a type of anomaly?
A) Insertion
B) Deletion
C) Update
D) All of the above
Answer: D
4. The process of dividing a relation into smaller relations is known as:
A) Normalization
B) Decomposition
C) Join
D) Functional dependency
Answer: B
5. A transitive dependency is a type of:
A) Anomaly
B) Functional dependency
C) Multivalued dependency
D) Join dependency
Answer: B

II. Fill in the Blanks:

1. A is a set of attributes in a relation that uniquely identifies a tuple.


Answer: primary key
2. ensures that no redundancy is present and data dependencies are logically
represented.
Answer: normalization
3. form eliminates all partial dependencies,
Answer: Second normal
4. form ensures that all attributes are functionally dependent only on the primary key.
Answer: Third normal
5. In relational databases, dependencies are a generalization of functional dependencies.
Answer: multivalued

III. True or False:

1. Functional dependencies are used to define normal forms.


Answer: True
2. Insertion anomalies can occur if a table is not in 2NF.
Answer: True
3. 5NF is concerned with join dependencies.
Answer: True
4. BCNF is stricter than 3NF.
Answer: True
5. Decomposing a relation can introduce redundancy.
Answer: False

IV. Match the Following:

1. Match the following terms with their descriptions:


1. Key A. A table in a database
2. Relation B. Unique identifier for data
3. Attribute C. A column in a table
4. Tuple D. A row in a table
a, 1 - C, 2 - D, 3 - A, 4 - B
b, 1 - B, 2 - C, 3 - A, 4 - D
c, 1 - B, 2 - A, 3 - C, 4 - D
d, 1 - D, 2 - C, 3 - B, 2 – A

2. Match the following terms with their contributions:


1. Anomaly A. Non-key attribute depends on part of
composite key
2. Functional dependency B. X --> Y means X determines Y
3. Partial dependency C. Problem due to data redundancy
4. Transitive dependency D. Non-key attribute depends on another
non-key attribute
a, 1 - D, 2 - B, 3 - C, 4 - A
b, 1 - C, 2 - B, 3 - D, 4 - A
c, 1 - A, 2 - B, 3 - D, 4 - C
d, 1 - C, 2 - B, 3 - A, 4 - D

3. Match the following keys with their key ideas:


1. Natural key A. Key with real-world meaning
2. Foreign key B. Key from another table
3. Candidate key C. Possible choice for primary key
4. Primary key D. Main unique identifier
a, 1 - D, 2 - A, 3 - B, 4 - C
b, 1 - A, 2 - B, 3 - C, 4 - D
c, 1 - D, 2- B, 3 - A, 4 - C
d, 1 - C, 2 - D, 3 - D, 4 - B

4. Match the following integrity types with their characteristics:


1. Data integrity A. Accuracy and Consistency of data
2. Referential integrity B. Foreign key matches primary key
3. Entity integrity C. Primary key must be unique and
not null
4. Redundancy D. Duplication of data
a, 1 - A, 2 - B, 3 - C, 4 - D
b, 1 - B, 2 - C, 3 - D, 4 - A
c, 1 - C, 2- B, 3 - A, 4 - D
d, 1 - D, 2- C, 3 - B, 4- A

5. Match the following types of dependency with their descriptions:


A. Attribute depends on another
1. Transitive dependency
through a third attribute
B. Attribute depends on multiple
2. Multivalued dependency
values of another attribute
3. Join dependency C. One attribute determines another
D. Generalization of multivalued
4. Functional dependency
dependencies
a, 1 - D, 2 - B, 3 - C, 4 - A
b, 1 - A, 2 - B, 3 - D, 4 - C
c, 1 - C, 2 - D, 3 - B, 4 - A
d, 1 - A, 2 - C, 3 - B, 4 - D

V. Short Answers:

1. What does 1NF stand for?


First Normal Form
2. What does 2NF eliminate?
Partial dependencies
3. What is the key requirement for 3NF?
No transitive dependencies
4. What is BCNF?
Boyce-Codd Normal Form
5. What does 4NF deal with?
Multivalued dependencies
SET - C

Subject Name: 21CS1401 - Database Management System Marks: 25


Each Question Carry ONE Mark
UNIT 3 - DATABASE DESIGN

I. Multiple Choice Questions:

1. Which of the following is not a normal form?


A) 1NF
B) 2NF
C) 6NF
D) 3NF
Answer: C
2. A primary key must be:
A) unique
B) Non-null
C) Both A and B
D) Either A or B
Answer: C
3. A minimal super key is called a:
A) Primary key
B) Candidate key
C) Foreign key
D) Composite key
Answer: B
4. Which normal form eliminates transitive dependencies?
A) 2NF
B) 3NF
C) BCNF
D) 4NF
Answer: B
5. In which normal form are all attributes functionally dependent on the primary key?
A) 1NF
B) 2NF
C) 3NF
D) BCNF
Answer: C

II. Fill in the Blanks:

1. form removes all multivalued dependencies.


Answer: Fourth normal
2. A relation is in form if it is in BCNF and does not have any join dependencies.
Answer: Fifth normal
3. dependencies occur when one attribute uniquely determines another attribute.
Answer: Functional
4. A decomposition is if it preserves all functional dependencies.
Answer: dependency preserving
5. The normal form is a stricter version of 3NF.
Answer: Boyce-Codd

III. True or False:

1. A candidate key is a minimal super key.


Answer: True
2. In 3NF, transitive dependencies are allowed.
Answer: False
3. A relation in 2NF must be in 1NF.
Answer: True
4. A relation in 3NF must be in 2NF.
Answer: True
5. A super key is a set of one or more columns that can uniquely identify a row.
Answer: True

IV. Match the Following:

1. Match the following anomalies with their descriptions:


1. Anomalies A. Problems during data modification
2. Update anomaly B. Insert, delete, update problems
3. Insertion anomaly C. Problems during data insertion
4. Deletion anomaly D. Problems during data deletion
a, 1 - C, 2 - D, 3 - A, 4 - B
b, 1 - B, 2 - C, 3 - A, 4 - D
c, 1 - B, 2 - A, 3 - C, 4 - D
d, 1 - D, 2 - C, 3 - B, 2 – A

2. Match the following terms with their contributions:


1. BCNF A. Column in a table
2. Schema B. Structure of the database
3. Attribute C. Boyce-Codd normal form
4. Tuple D. Row in a table
a, 1 - D, 2 - B, 3 - C, 4 - A
b, 1 - C, 2 - B, 3 - D, 4 - A
c, 1 - A, 2 - B, 3 - D, 4 - C
d, 1 - C, 2 - B, 3 - A, 4 - D

3. Match the following normal forms with their key ideas:


1. First normal form (1NF) A. No repeating groups or arrays
2. Second normal form (2NF) B. No partial dependencies
3. Third normal form (3NF) C. No transitive dependencies
4. Fourth normal form (4NF) D. No multivalued dependencies
a, 1 - D, 2 - A, 3 - B, 4 - C
b, 1 - A, 2 - B, 3 - C, 4 - D
c, 1 - D, 2- B, 3 - A, 4 - C
d, 1 - C, 2 - D, 3 - D, 4 - B

4. Match the following key types with their characteristics:


1. Candidate key A. Potential primary key
2. Primary key B. Unique identifier for records
3. Foreign key C. Key that references a primary key
in another table
4. Super key D. Set of attributes uniquely
identifying a row
a, 1 - A, 2 - B, 3 - C, 4 - D
b, 1 - B, 2 - C, 3 - D, 4 - A
c, 1 - C, 2- B, 3 - A, 4 - D
d, 1 - D, 2- C, 3 - B, 4 - A

5. Match the following terms with their descriptions:


A. Process to reduce redundancy and
1. Normalization
anomalies
B. Splitting relations into smaller
Decomposition
2. relations
3. Dependency preservation C. No data loss after decomposition
D. Ensuring all functional
Lossless decomposition
4. dependencies are maintained
a, 1 - D, 2 - B, 3 - C, 4 - A
b, 1 - A, 2 - B, 3 - D, 4 - C
c, 1 - C, 2 - D, 3 - B, 4 - A
d, 1 - A, 2 - C, 3 - B, 4 - D

V. Short Answers:

1. What is a join dependency?


A generalization of multivalued dependencies.
2. What is decomposition?
The process of breaking a relation into smaller relations.
3. What is a foreign key?
An attribute that references a primary key in another table.
4. What is dependency preservation?
Ensuring all functional dependencies are preserved in decomposition.
5. What is lossless decomposition?
Decomposition that ensures no data is lost.
SET - D

Subject Name: 21CS1401 - Database Management System Marks: 25


Each Question Carry ONE Mark
UNIT 3 - DATABASE DESIGN

I. Multiple Choice Questions:

1. A relation with no multivalued dependencies is in:


A) 1NF
B) 2NF
C) 4NF
D) 5NF
Answer: C
2. Which type of dependency involves one attribute uniquely determining another?
A) Transitive
B) Multivalued
C) Functional
D) Join
Answer: C
3. Which normal from is considered with join dependencies?
A) 1NF
B) 4NF
C) 5NF
D) BCNF
Answer: C
4. The term ‘lossless decomposition’ refers to:
A) Breaking a table without losing data
B) Increasing redundancy
C) Eliminating anomalies
D) None of the above
Answer: A
5. Dependency preservation is important because:
A) It maintains data integrity
B) It ensures no data loss
C) It reduces redundancy
D) All of the above
Answer: D

II. Fill in the Blanks:

1. dependencies involve a set of attributes being dependent on another set.


Answer: Join
2. The process of breaking down a relation into smaller relations is known as .
Answer: decomposition
3. A relation is in form if it has no repeating groups.
Answer: First normal
4. ensures that the database remains free from anomalies.
Answer: Normalization
5. is the process of organizing data in a database to reduce redundancy.
Answer: Normalization

III. True or False:

1. Anomalies are undesirable side-effects of redundancy.


Answer: True
2. Functional dependencies are always represented by foreign keys.
Answer: False
3. A transitive dependency involves more than one attribute.
Answer: True
4. A relation in 3NF can still have partial dependencies.
Answer: False
5. Normalization always leads to lossless decomposition.
Answer: True

IV. Match the Following:

1. Match the following dependencies with their descriptions:


1. Functional dependency A. Attribute depends on multiple
values of another
2. Multivalued dependency B. One attribute determines another
3. Transitive dependency C. Attribute depends on another
through a third
4. Join dependency D. Generalization of multivalued
dependencies
a, 1 - C, 2 - D, 3 - A, 4 - B
b, 1 - B, 2 - C, 3 - A, 4 - D
c, 1 - B, 2 - A, 3 - C, 4 - D
d, 1 - D, 2 - C, 3 - B, 2 – A

2. Match the following terms with their contributions:


1. Data integrity A. No data loss when relations are
recombined
2. Anomalies B. Undesirable side effects of
redundancy
3. Lossless join C. Accuracy and consistency of data
4. Schema refinement D. Process to improve database schema
a, 1 - D, 2 - B, 3 - C, 4 - A
b, 1 - C, 2 - B, 3 - D, 4 - A
c, 1 - A, 2 - B, 3 - D, 4 - C
d, 1 - C, 2 - B, 3 - A, 4 - D

3. Match the following keys with their key ideas:


1. Primary key A. Unique identifier for a record
2. Candidate key B. Minimal super key
C. One or more attributes uniquely
3. Super key
identifying a row
4. Foreign key D. References primary key in another
table
a, 1 - D, 2 - A, 3 - B, 4 - C
b, 1 - A, 2 - B, 3 - C, 4 - D
c, 1 - D, 2- B, 3 - A, 4 - C
d, 1 - C, 2 - D, 3 - D, 4 - B

4. Match the following terms with their characteristics:


1. Decomposition A. Breaking down relations into
smaller ones
2. Dependency preservation B. All dependencies preserved
3. Lossless decomposition C. No data loss after decomposition
4. Anomalies D. Undesirable side effects of
redundancy
a, 1 - A, 2 - B, 3 - C, 4 - D
b, 1 - B, 2 - C, 3 - D, 4 - A
c, 1 - C, 2- B, 3 - A, 4 - D
d, 1 - D, 2- C, 3 - B, 4 - A

5. Match the following types of companies with their descriptions:


1. Schema refinement A. Process to eliminate redundancy
B. Organizing data to reduce
Normalization
2. redundancy
3. Redundancy C. A table in a database
4. Relation D. Duplication of data
a, 1 - D, 2 - B, 3 - C, 4 - A
b, 1 - A, 2 - B, 3 - D, 4 - C
c, 1 - C, 2 - D, 3 - B, 4 - A
d, 1 - A, 2 - C, 3 - B, 4 - D

V. Short Answers:

1. What is an anomaly?
An undesirable side effect of redundancy.
2. What is an insertion anomaly?
A problem that occurs during data insertion in a poorly normalized table.
3. What is an deletion anomaly?
A problem that occurs during data deletion in a poorly normalized table.
4. What is an update anomaly?
A problem that occurs during data modification in a poorly normalized table.
5. What is schema refinement?
The process of improving a database schema to eliminate redundancy.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy