VISAKHA INSTITUTE OF ENGINEERING &

Mid Exam Question Paper TECHNOLOGY

Department of COMPUTER SCIENCE & ENGINEERING Mid : II

Semester : II Program : II B. Tech AY : 2023
Date : 16-5-2023 Time : 90 MIN Max. Marks : 30
Course Code :R2022052 Course Title :DBMS
FACULTY NAME :D.HARITHA
Answer ALL the following questions
CO: Course Outcome no. (1-6), LEVEL: Revised Bloom’s Taxonomy level no. (1-6)
* L1 (R) : Remembering, L2 (U) : Understanding, L3 (P) : Applying,
*L4 (A) : Analyzing, L5 (E) : Evaluating, L6 (C) : Creating.
UNIT-1

Max.
CO LEVEL Q.N. Question (s)
Marks
a)what is an entity set? Define relationship set and explain the symbols used
L1 to draw ER diagram
CO3 1 10 M
&L2
b) What is a weak entity in ER diagram?

Consider a database used to record the marks that students get in different
exams of different course offerings

a) Construct an E-R diagram that models exams as entities, and uses a ternary
relationship, for the above database.
CO3 L3&L6 2 10 M
b) Construct an alternative E-R diagram that uses only a binary relationship
between students and course offerings. Make sure that only one relationship
exists between a particular student and course-offering pair, yet you can
represent the marks that a student gets in different exams of a course
offering.

a)Explain the distinctions among the terms primary key, candidate key and
L1&L2 3 10 M
CO3 super key.

b)What is a nested query? Explain with SQL examples.

CO3 L3&L6 4 A university registrar’s office maintains data about the following entities 10 M

a)courses, including title,credits,syllabus, and prerequisites

b)course offerings, including course number,year,semester, section

number,instructors,timings and classroom

c)students, including student-id, name, and program

d)instructors, including identification number, name, department, and title.

Further, the enrollment of students in courses and grades awarded to

students in each course they are enrolled for must be appropriately modeled.
 VISAKHA INSTITUTE OF ENGINEERING &
Mid Exam Question Paper TECHNOLOGY

Construct an E-R diagram for the registrar’s office. Document all assumptions
that you make about the mapping constraints.

a) Explain the main steps in database design. What is the goal of each step?
To which step is the ER model mainly used? Why?
CO3 L1&L2 5 10 M
b) What is grouping in SQL? With examples explain GROUP BY & HAVING
clauses.

UNIT-2

LEVE Q. Max.
CO Question (s)
L N. Marks
Consider the relation on attributes(ABCDE) with functional dependencies

AB->CDE,AC->BDF,B->C,C->B,C->D,B->E
L3 1 10 M
CO4
a) Determine a key for Relation R.

b) Find 3NF decomposition for R using normalization process.

a)When is the decomposition of a relational schema R into two relational

schemas X and Y said to be lossless join decomposition? Why is this
property so important? Give a necessary and sufficient condition to test
CO4 L1 2 whether decomposition is lossless join. 10 M

b)Define multivalued dependencies and join dependencies. Discuss the use

of such dependencies in database design.

a) Explain 1NF,2NF and 3 NF with suitable examples.

b)Consider the schema R->(A,B,C,D,E) and the functional dependencies:

L2&L3 3 10 M
CO4
A->BC,CD->E,B->D,E->A. Give a lossless join decomposition into BCNF of the
schema R.

CO4 L1&L3 4 a) Consider the instance of a relation shown below 10 M

X Y Z

X1 Y1 Z1

X1 Y1 Z2

X2 Y1 Z1

X2 Y1 Z3

List all the functional dependencies that this relational instance satisfies.

b) What is meant by closure of functional dependencies? Illustrate with an

 VISAKHA INSTITUTE OF ENGINEERING &
Mid Exam Question Paper TECHNOLOGY

example.

a)What is the need of normalization? What are the problems caused

by redundancy?
CO2 L2 5 10 M
b) What is a functional dependency? List and explain the various
types of functional dependencies.

UNIT-3

LEVE Q.N Max.

CO Question (s)
L . Marks
L1&L Explain about the measures that are to be considered for comparing the
CO5 2 1 performance of various file organization techniques. 10 M

a) Consider a database with object s X and Y and assume that

there are two transactions T1 and T2.Transaction T1 reads
objects X and Y and then writes objects X, Transaction T2
reads objects X and Y and then writes objects X and Y. Give
CO5 L1&L 2 an example schedule with actions of transactions T1 and T2 10 M
3 on objects X and Y that results in a write read conflict.’

b) What are ACID properties?

a)Explain briefly B+ tree file organization.

L2&L b)Construct a B+ tree of order 3 for the following set of key
CO5 3 3 10 M
values 1,2,5,,10,13,18,21,26,37.Assume that the tree is initially
empty and elements are entered in the given order.

a)What is database recovery? Explain Shadow paging in detail.

b)Explain about
CO5 L1 4.
i)Clustered index

ii)Primary index

a)What is locking protocol? Describe the strict two-Phase locking

L1&L protocol.
CO5 5.
2 b) Explain what is timestamp based concurrency control?