SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

Ramapuram Campus, Bharathi Salai, Ramapuram, Chennai - 600089

FACULTY OF ENGINEERING AND TECHNOLOGY

DEPARTMENT OF INFORMATION TECHNOLOGY

QUESTIONBANK

Degree & Branch : B.TECH- IT

: : IV/II

Semester & Year

Sub Code & Subject Name : 21CSC205P- Database Management Systems

: 2021

Regulation
Degree & Branch : B.TECH- IT
: 2023-2024

Academic Year

SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

Ramapuram Campus, Bharathi Salai, Ramapuram, Chennai-600089

DEPARTMENT OF INFORMATION TECHNOLOGY

UNIT-4
QUESTION BANK

Course Code/Course Name : 21CSC205P/ Database Management Systems

SEM/YEAR: IV/II

Course Outcome:
CO4: Removal of anomalies using Normalization concepts

Normalization, Need for Normalization,NF1, NF2, NF3, NF4, NF5, Case Study: Apply
Conversion rules and normalize the Database.

Course Competence
Q.No. Questions Outcome BT Level
A function that has no partial functional dependencies is in
_______form.
A. 4NF
1 CO4 BT1
B. 3NF
C. 2NF
D. BCNF
 Course Competence
Q.No. Questions Outcome BT Level
__________ is used to change the values of some attributes in
existing tuples.

A. Update
2 CO4 BT1
B. Drop
C. Truncate
D. Select
A BCNF is :
A. loss less join and dependency preserving
B. loss less join but not dependency preserving
3 BT1
C. not loss less join but dependency preserving CO4
D. Partial Dependency and left join
Which of the following is a tuple-generating dependencies ?

A. Functional dependency
CO4
4 B. Equality-generating dependencies BT1
C. Multivalued dependencies
D. Non-functional dependency
The main task carried out in the __________ is to remove
repeating attributes to separate tables.

A. First Normal Form CO4

5 BT1
B. Second Normal Form
C. Third Normal Form
D. Fourth Normal Form
For some relations, changing the data can have undesirable
consequences called:
A. referential integrity constraints
CO4
6 B. modification anomalies BT1
C. normal forms
D. transitive dependencies
Relationship can be created between

A. two tables only

CO4
7 B. one table only BT1
C. two or more tables
D. none of the above
 Course Competence
Q.No. Questions Outcome BT Level
Every Boyee-Codd normal form is in
A. First normal form

8 B. Second normal form BT1

CO4
C. Third normal form
D. All of the above
If a table has been normalized so that all determinants are
candidate keys, then that table is in:
A. 1NF
9 BT1
B. 2NF
CO4
C. 3NF
D. BCNF
Which forms has a relation that possesses data about an individual
entity?

A. 2NF
10 BT1
B. 3NF
CO4
C. 4NF
D. 5NF
The different classes of relations created by the technique for
preventing modification anomalies are called:
A. Normal forms
11 B. Referential integrity constraints CO4 BT2
C. Functional dependencies
D. None of the above is correct.
The procedure of storing higher normal form relations which are
in lower normal form as a base relation is classified as
A. isolation of data
12 CO4 BT1
B. de-normalization of data
C. normalization of data
D. denomination of data
The normal form which only includes indivisible values or single
atomic values is classified as
A. third normal form
13 B. first normal form CO4 BT1
C. second normal form
D. fourth normal form
 Course Competence
Q.No. Questions Outcome BT Level
Which of the following statements about normal forms is FALSE?

A. BCNF is stricter than 3NF

B. Lossless, dependency-preserving decomposition into 3NF is
14 CO4 BT1
always possible.
C. Lossless, dependency-preserving decomposition into BNF is
always possible.
D. Any relation with two attributes is in BCNF.
Third normal form is based on the concept of__________.
A. transitive dependency
15 B. partial dependency CO4 BT1
C. multivalued dependency
D. full functional dependency
The only attribute values permitted by 1NF are __________values.

A. Divisible
16 CO4 BT1
B. Single atomic
C. Multiple
D. Numeric
A table that displays data redundancies yields ____________
anomalies
A. Insertion
17 CO4 BT1
B. Deletion
C. Update
D. All of the above
Anomalies are avoided by splitting the offending relation into
multiple relations,is also known as_______.
A. Accupressure
18 BT1
B. Decomposition
CO4
C. Precomposition
D. Both decomposition & precomposition
Which of the following is true ?

A. A relation in BCNF is always in 3NF

19 CO4 BT3
B. A relation in 3NF is always in BCNF
C. BCNF and 3NF are same
D. A relation in BCNF is not in 3NF
Third normal form is based on the concept of ______.

A. Closure Dependency
20 BT1
B. Transitive Dependency
CO4
C. Normal Dependency
D. Functional Dependency
 Course Competence
Q.No. Questions Outcome BT Level
Inst_dept (ID, name, salary, dept name, building, budget) is
decomposed into

instructor (ID, name, dept name, salary)

department (dept name, building, budget)

21 CO4 BT3
This comes under

A. Lossy-join decomposition
B. Lossy decomposition
C. Lossless-join decomposition
D. Both a and b
A relation that has no partial dependencies is in which normal
form
A. First
22 BT3
B. Second
CO4
C. Third
D. BCNF
First normal form disallows ___________.

A. indivisible values
23 CO4 BT1
B. divisible values
C. single atomic values
D. multivalued attributes
In 2NF

A. No functional dependencies (FDs) exist

24 CO4 BT2
B. No multivalued dependencies (MVDs) exist
C. No partial FDs exist
D. No partial MVDs exist
_____________ can help us detect poor E-R design.

A. Database Design Process

25 CO4 BT2
B. E-R Design Process
C. Relational scheme
D. Functional dependencies
A functional dependency between two or more non-key attributes
is called
A. Transitive dependency
26 B. Partial transitive dependency CO4 BT2
C. Functional dependency
D. Partial functional dependency
 Course Competence
Q.No. Questions Outcome BT Level
Which of the following is based on Multi Valued Dependency?
A. First normalization form
B. Second normalization form
27 C. Third normalization form CO4 BT3
D. Fourth normalization form

A large number of commercial applications running against

relational databases is called as _____________________
A. Data Control Language
28 CO4 BT1
B. Structured Query Language
C. Online Transaction Processing
D. MongoDataBase
A simple tuple relational calculus query is of the form:

A. {p | COND(t)}
29 CO4 BT1
B. {t | COND(t)}
C. {p | COND(p)}
D. {p| P(t)}
Which of the following is the result of bad database design?
A. Repetition of Information
30 B. Inability to represent some information CO4 BT1
C. Inconsistent database state due to some transaction
D. All of the above
Third normal form (3NF) is based on the concept of
______________.

31 A. Partial Dependency CO4 BT1

B. Multivalued Dependency
C. Transitive Dependency
D. Join Dependency
Second normal form (2NF) is based on the concept of

A. Partial Dependency
32 CO4 BT1
B. Multivalued Dependency
C. Transitive Dependency
D. Full Functional Dependency.
An attribute is called _________,if it is not a member of any
candidate key.

33 A. Prime CO4 BT1

B. Non-prime
C. Composite
D. Derived
 Course Competence
Q.No. Questions Outcome BT Level
4NF is designed to cope with:
A. Transitive Dependency
34 B. Join Dependency CO4 BT2
C. Multi valued Dependency
D. Partial Dependency
The normalization form which is based on the transitive dependency is
classified as
A. first normal form
35 CO4 BT2
B. second normal form
C. fourth normal form
D. third normal form
_______________denoted by JD(R1, R2, ..., Rn), specified on
relation schema R, specifies a constraint on the states r of R.

36 A. Partial Dependency CO4 BT2

B. Join Dependency
C. Join Decomposition
D. Join Database
The normalization process, as first proposed by
A. Edgar F. Codd
37 B. Peter Landin CO4 BT1
C. Mark Edward
D. Sandford
In DBMS FD stands for _______

A. Facilitate data
38 B. Functional data CO4 BT3
C. Facilitate dependency
D. Functional dependency

An attribute of relation schema R is called ___________of R if it is

a member of some candidate key of R.

39 A. a non-prime attribute CO4 BT2

B. a prime attribute
C. Composite attribute
D. Derived attribute
5NF is designed to cope with :
A. Transitive dependency
40 B. Join dependency CO4 BT3
C. Multi valued dependency
D. All of the above
 Course Competence
Q.No. Questions Outcome BT Level
If X --> Y is a functional dependency and X and Y are sets of
attributes, what is the relationship between X and Y?

41 A. One-to-Many CO4 BT1

B. Many-to-One
C. One-to-One
D. Many-to-Many
For some relations, changing the data can have undesirable
consequences called:
A. Referential integrity constraints
42 B. Modification anomalies CO4 BT1
C. Normal forms
D. Transitive dependencies

A relation in this form is free of all modification anomalies.

A. First normal form
43 B. Second normal form CO4 BT1
C. Third normal form
D. Domain/key normal form
One solution to the multivalued dependency constraint problem is
to:
A. split the relation into two relations, each with a single
theme.
44 CO4 BT2
B. change the theme.
C. create a new theme.
D. add a composite key.

A functional dependency is a relationship between or among:

A. Tables
45 B. Rows CO4 BT1
C. Relations
D. Attributes

A table is in 2NF if it is in 1NF and if:

A. no column that is not a part of the primary key is dependent on
only a portion of the alternate key.
B. no column that is not a part of the primary key is
46 CO4 BT2
dependent on only a portion of the primary key.
C. no column that is not a part of the primary key is dependent on
only a portion of the foreign key.
D. none of these
 Course Competence
Q.No. Questions Outcome BT Level
______________is the process of storing the join of higher normal
form relations as a base relation, which is in a lower normal form.
A. Denormalization
47 CO4 BT1
B. Normalization
C. Dependency
D. Relational Algebra
The normal form which satisfies multivalued dependencies and
which is in BCNF is
A. 4 NF
48 B. 3 NF CO4 BT2
C. 2 NF
D. All of the mentioned
Which normal form is considered adequate for relational database
design?

49 A. 2NF CO4 BT1

B. 3NF
C. 4 NF
D. BCNF
A relation is in this form if it is in BCNF and has no multivalued
dependencies:
A. second normal form.
B. third normal form.
50 C. fourth normal form. CO4 BT2
D. domain/key normal form.

PART B (4 Marks)
 Course Competence
Q.No. Questions Outcome BT Level
Explain 2NF.
 In the 2NF, relational must be in 1NF.
 In the second normal form, all non-key attributes are fully
functional dependent on the primary key
Example: Let's assume, a school can store the data of teachers and the
subjects they teach. In a school, a teacher can teach more than one
subject.
TEACHER table:
TEACHER_ID SUBJECT TEACHER_AGE
25 Chemistry 30
25 Biology 30
47 English 35
83 Math 38
83 Computer 38
1 In the given table, non-prime attribute TEACHER_AGE is dependent BT2
on TEACHER_ID which is a proper subset of a candidate key. That's
why it violates the rule for 2NF.
To convert the given table into 2NF, we decompose it into two tables: CO4
TEACHER_DETAIL table:
TEACHER_ID TEACHER_AGE
25 30
47 35
83 38
TEACHER_SUBJECT table:
TEACHER_ID SUBJECT
25 Chemistry
25 Biology
47 English
83 Math
83 Computer
Write short note on normalization.
Ans:
Database Normalization is a design technique. Using this we can
design or re-design schemas in the database to reduce redundant data
and the dependency of data by breaking the data into smaller and more
2 relevant tables. BT1
CO4
The primary purpose of the normalization is to reduce the data
redundancy i.e. the data should only be stored once. This is to avoid
any data anomalies that could arise when we attempt to store the same
data in two different tables, but changes are applied only to one and
not to the other.
 Course Competence
Q.No. Questions Outcome BT Level
Explain 1NF with suitable example.
Ans:
First Normal Form (1NF):
o A relation will be 1NF if it contains an atomic value.
o It states that an attribute of a table cannot hold multiple values.
It must hold only single-valued attribute.
o First normal form disallows the multi-valued attribute,
composite attribute, and their combinations.
Example:
3 Relation STUDENT in table 1 is not in 1NF because of multi-valued BT1
attribute STUD_PHONE. Its decomposition into 1NF has been shown CO4
in table 2.

Explain Insert Anomalies with example.

Ans:
Insertion anomaly:
If a tuple is inserted in referencing relation and referencing attribute
value is not present in referenced attribute, it will not allow inserting
in referencing relation. For Example, If we try to insert a record in
STUDENT_COURSE with STUD_NO =7, it will not allow.

4 CO4 BT2
 Course Competence
Q.No. Questions Outcome BT Level
Illustrate functional dependency with example?
Ans:
Functional Dependency (FD) is a constraint that determines the
relation of one attribute to another attribute in a Database Management
System (DBMS). Functional Dependency helps to maintain the quality
of data in the database.
A functional dependency is denoted by an arrow “→”. The functional
dependency of X on Y is represented by X → Y.
Example:

Employee
Employee Name Salary City
number
5 BT2
CO4
1 Dana 50000 San Francisco

2 Francis 38000 London

3 Andrew 25000 Tokyo

In this example, if we know the value of Employee number, we can

obtain Employee Name, city, salary, etc. By this, we can say that the
city, Employee Name, and salary are functionally depended on
Employee number.
 Course Competence
Q.No. Questions Outcome BT Level
Demonstrate transitive dependency? Give an example?
Ans:
A functional dependency is said to be transitive if it is indirectly
formed by two functional dependencies. For Eg: X -> Z is a transitive
dependency if the following three functional dependencies hold true:
X->Y
Y does not ->X
Y->Z
Example:

Book Author Author_age

Game of Thrones George R. R. Martin 66

6 BT2
Harry Potter J. K. Rowling 49 CO4

Dying of the Light George R. R. Martin 66

{Book} ->{Author} (if we know the book, we knows the author name)

{Author} does not ->{Book}

{Author} -> {Author_age}

Therefore as per the rule of transitive dependency: {Book} ->

{Author_age} should hold, that makes sense because if we know the
book name we can know the author’s age.
 Course Competence
Q.No. Questions Outcome BT Level
Define Armstrong axioms for FD’s?
Ans:
1. Reflexive Rule (IR1)
In the reflexive rule, if Y is a subset of X, then X determines Y.
If X ⊇ Y then X → Y
2. Augmentation Rule (IR2)
The augmentation is also called as a partial dependency. In
augmentation, if X determines Y, then XZ determines YZ for any Z.
3. Transitive Rule (IR3)
In the transitive rule, if X determines Y and Y determine Z, then X
must also determine Z.
If X → Y and Y → Z then X → Z
4. Union Rule (IR4)
Union rule says, if X determines Y and X determines Z, then X must
7 CO4 BT2
also determine Y and Z.
If X → Y and X → Z then X → YZ
5. Decomposition Rule (IR5)
Decomposition rule is also known as project rule. It is the reverse of
union rule.
This Rule says, if X determines Y and Z, then X determines Y and X
determines Z separately.
If X → YZ then X → Y and X → Z
6. Pseudo transitive Rule (IR6)
In Pseudo transitive Rule, if X determines Y and YZ determines W,
then XZ determines W.
7.Composition (IR7)
If A → B and X → Y then AX → BY

Explain about BCNF?

Ans:
 BCNF is the advance version of 3NF. It is stricter than 3NF.
 A table is in BCNF if every functional dependency X → Y, X
is the super key of the table.
 For BCNF, the table should be in 3NF, and for every FD, LHS
8 is super key. CO4 BT2
 BCNF decomposition does not always satisfy dependency
preserving property.
 After BCNF decomposition if dependency is not preserved
then we have to decide whether we want to remain in BCNF or
rollback to 3NF. This process of rollback is called
denormalization.
 Course Competence
Q.No. Questions Outcome BT Level
Give the advantages and disadvantages of data redundancy
Advantages of data redundancy:
Provides Data Security: Data redundancy can enhance data security
as it is difficult for cyber attackers to attack data that are in different
locations.
Provides Data Reliability: Reliable data improves accuracy because
organizations can check and confirm whether data is correct.
9 Create Data Backup: Data redundancy helps in backing up the data. CO4 BT2
Disadvantages of data redundancy :
Data corruption: Redundant data leads to high chances of data
corruption.
Wastage of storage: Redundant data requires more space, leading to a
need for more storage space.
High cost: Large storage is required to store and maintain redundant
data, which is costly.
What is Denormalization? Give it’s advantages and disadvantages.
Denormalization is a database optimization technique where
we add redundant data in the database to get rid of the complex join
operations. This is done to speed up database access speed.
Denormalization is done after normalization for improving the
performance of the database. The data from one table is included in
another table to reduce the number of joins in the query and hence
helps in speeding up the performance.
10 CO4 BT2
Advantages of Denormalization:
Query execution is fast since we have to join fewer tables.
Disadvantages of Denormalization:
 As data redundancy is there, update and insert operations are
more expensive and take more time. Since we are not
performing normalization, so this will result in redundant data.
 Data Integrity is not maintained in denormalization. As there is
redundancy so data can be inconsistent.
PART C (12 Marks)

1 Define Functional Dependencies. Discuss about different functional CO4 BT1

dependencies
What are the problems caused by Redundancy? Explain about CO4
2 BT1
Normalization and need for normalization.
Define Normalization. Explain about 1NF, 2NF with relevant CO4
3 BT1
examples.
4 Explain about 3NF and BCNF with relevant table structure. CO4 BT2
5 List out Codd's Relational Database rules.
Explain about Multi-valued dependencies and Fifth Normal Form with
6 CO4 BT2
suitable examples.