Final Assessment Test

Answer all the Questions

Sub.
Q.No. Question Description Marks
Sec.

1 In a college database system user1 is a library clerk who deals with the student and book 10
information, User2 is an account office clerk who deals with students detail and fee detail.
Show the specific information actually available at each level of schemas with respect to the
particular user.

2 a) Model the entities and relationships (including attributes and properties of relationships) 10
described below in an ER-diagram.

The LMF Zoo has many types of animals. Every type has a unique name. Every animal of the
same type has a unique animal ID. Animals in two types may have the same animal ID.
Animals also have age and gender. Animals may have diseases. The beginning time and the
duration of a disease need to be recorded. A disease has a unique name. A type keeper takes
care of only one type of animals. Every type may have many type keepers. A type keeper may
or may not be familiar with diseases. But every disease must be handled by at least one type
keeper. Type keepers have name, employee ID, ssn, address and phone number. All animals
are in cages. Some cage may be empty. Every cage has a cage ID, space and height. A cage
keeper may take care of many cages. Every non-empty cage must have at least one cage
keeper. Empty cages dont need any cage keepers. Cage keepers have name, employee ID,
ssn, address and phone number.

2 b) Consider the following ER Diagram - 5

How many minimum numbers of tables are required and Which is the common attribute set
of each of minimization table? Justify your answer.

3 Consider the following relation for published books: 15

BOOK (Book_title, Author_name, Book_type, List_price, Author_affil, Publisher)
Author_affil refers to the affiliation of author. Suppose the following dependencies exist:
Book_title Publisher, Book_type
Book_type List_price
Author_name Author_affil
a. What normal form is the relation in? Explain your answer.
b. Apply normalization until you cannot decompose the relations further.
State the reason behind each decomposition.

4 Consider the two transactions T1, T2, that operate on the balance of two bank accounts and the 15
schedules S1, S2, S3 and S4 given below. Draw the serializability (precedence) graphs for S1, S2, S3 and
Page 1 of 2
 S4 and state whether each schedule is conflict serializable or not.

Schedule 1 Schedule 2

Schedule 3 Schedule 4

5 Consider the following two transactions: 15

Add lock and unlock instructions to transactions T1 and T2, so that they observe the two- phase locking
protocol. Analyse how the resulting code eliminates (i) Lost Update (ii) Uncommitted update
(iii) Inconsistent Summary. Justify
6 a) Consider a student details relation with the attributes student name, branch, semester, CGPA. 5
Student name is used for indexing. Differentiate dense and sparse index for the student details
relation. When it is preferable to use a dense index rather than a sparse index? Justify your
answer.

b) Consider a disk with block size B = 512 bytes. A block pointer is P = 8 bytes long, and a record 10
pointer is Pr = 9 bytes long. A file has r = 50,000 STUDENT records of fixed-size R = 147 bytes.
In the file, the key field is ID#, whose length V = 12 bytes. Come up with the solution for the
given situation.

- If an unspanned organisation is used, what are the blocking factor bfr and the number
of file blocks b?

- Suppose that the file is ordered by the key field ID# and we want to construct a
primary index on ID#. Calculate the index blocking factor bfri.

7 Explain in detail the features of each of the four types of NoSQL data model with use cases. 15

Page 2 of 2