This document contains a model question paper for the 5th semester Database Management Systems subject for Computer Science and Engineering students. It consists of 8 questions covering key topics like data abstraction, relational data model concepts, normalization, relational algebra, relational constraints, decomposition, file organization, indexing, concurrency control, and locking protocols. Students are required to answer 7 out of the 8 questions in detail addressing theoretical concepts and solving practical problems.

1. Model Question paper
B.Tech 5th
Semester
Branch: Computer Science and Engineering
Subject: Database Management System
1. Answer any seven: 7x2=14
a) What is the most appropriate matching between the following sets w.r.t. data abstraction:
S1: {w: physical level; x: logical level; y: view level}
S2: {p: describes what data is stored; q: describes how the data is stored; r: describes only part of the database}
(i) w--p; x--q; y--r (ii) w--p; x--r; y—q (iii) w--q; x--p; y--r (iv) w--q; x--r; y--p
b) What is FALSE regarding the relational data model:
i) A relational database consists of a collection of tables.
ii) The term “tuple” refers to an element in a relation instance.
iii) The tuples in a relation instance appear in a sorted order.
iv) For each attribute of a relation, there is a set of permitted values.
c) Consider the statements given below:
S1: The participation of an entity set S in a relationship set R is said to be total if every entity in S participates in
at least one relationship in R.
S2: The participation of an entity set S in a relationship set R is said to be partial if some entities in S participate
in R.
Choose the correct option:
i) S1: TRUE; S2: TRUE ii) S1: FALSE; S2: TRUE iii) S1: FALSE; S2: FALSE iv) S1: TRUE; S2: FALSE
d) The join operation on two relations can be equivalently realised by doing
(i) A cartesian product of the two relations followed by a selection
(ii) A cartesian product of the two relations
(iii) A union of the two relations followed by a selection
(iv) A union of two relations
e) Any given relation in a relational DB is always in:
i) 1NF ii) 2NF iii) 3NF iv) BCNF
f) The RDBMS system is not responsible for ensuring which of the following properties?
i) Atomicity ii) Consistency iii) Isolation iv) Durability
g) To be conflict serializable, all transactions should follow _______
i) Binary locking ii) Two phase locking
ii)iii) Binary Locking with wait-for graph iv) None of these
h) Suppose F is the file containing the first level of a secondary index built on a non-ordering key-field for a data
file. The blocking factor of F is independent of which of the following?
i) Block size ii) Length of the block pointer iii) Length of the non-ordering key field iv) Length of record pointer
i) An Entity-Relationship (ER) Model represents:
i) The various entity types of interest and the relationships among them in the domain being modeled.
ii) Various tables and links among them in the domain being modeled.
iii) The various entity types of interest and the relationships among them in the domain being modeled along with
operations to be performed on data.
iv) Various tables and links among them in the domain being modeled along with operations to be performed on data.
2. a) List any five applications of DBMS. Shows the disadvantages of File processing systems. 7
b) What is an ER model? Discuss different types of attributes in ER model. 7

2. 3. a) Discuss basic operation of relational algebra using suitable example. 7
b) What are four relational constraints? Briefly explain them with example. 7
4. a) What is lossy and lossless decomposition? For given R (ABCDEG) and FD:{AB C, AC B, AD E, B D,
BC A,E G, Check whether decomposition D(AB, BC, ABDE, EG) is lossy or lossless. 7
b) Given relation R (ABCDEF) and FD set {A FC, C D, B E}. Determine whether the given R is in 3NF? If not
convert it into 3NF. 7
5. a) Why normalization is needed? Briefly explain the concept of FD. 7
b) For given R (ABCD), Find CK for given FD set (AB CD, C A, D B). 7
6. a) Based on the given schema and write SQL query to retrieve below data 7
i) Find branch name and account number, where balance is greater than equal to 100 and less than equal to 1000.
ii) Find customer name which have loan from branch with asset is less than 1000000.
b) Suppose that we have an ordered file of 30,000 records and these records are stored on a disk and block size is 1024
bytes files records of fixed length and unspanned of size 100 byte and suppose that we have created a primary index on key
field of size 9 bytes and a block pointer of size 6 bytes then find the average number of block access required with or
without index? 7
7. a) Explain in detail about timestamp based concurrency control techniques. 7
b) Construct a B-tree of order 4, for the keys: 2, 5, 10, 1, 6, 9, 4, 3, 12, 18, 20, 25. 7
8. Write short notes on 4x3.5
a) Database Indexing
b) ACID properties
c) Delete Cascading
d) 2-phase locking protocol