18CS53

USN

RV COLLEGE OF ENGINEERING®
(An Autonomous Institution affiliated to VTU)
V Semester B. E. Examinations Apr-2024
Computer Science and Engineering
DATABASE DESIGN
Time: 03 Hours Maximum Marks: 100
Instructions to candidates:
1. Answer all questions from Part A. Part A questions should be answered in first three
pages of the answer book only.
2. Answer FIVE full questions from Part B. In Part B question number 2, 7 and 8 are
compulsory. Answer any one full question from 3 and 4 & one full question from 5
and 6.

PART-A M BT CO

1 1.1 Define Database. 01 1 1

1.2 ______ module of the 𝐷𝐵𝑀𝑆 controls access to 𝐷𝐵𝑀𝑆 information that
is stored on disk. 01 1 1
1.3 Find the closure of 𝐵𝐶 for given relation 𝑅(𝐴, 𝐵, 𝐶, 𝐷, 𝐸) has the
following functional dependencies 𝑃 → 𝑄, 𝑄 → 𝑅, 𝑄𝑅 → 𝑃, 𝑃 → 𝑆, 𝑇 → 𝑃,
𝑆 → 𝑇. 02 3 3
1.4 If 𝑋 → 𝑌𝑍 then 𝑋 → 𝑌 and 𝑋 → 𝑍 is ______ rule. 01 2 2
1.5 Define Views. 02 1 1
1.6 Find Key of 𝑅 for the relation scheme 𝑅 = {𝐸, 𝐹, 𝐺, 𝐻, 𝐼, 𝐽, 𝐾, 𝐿, 𝑀, 𝑀} and
the set of functional dependencies {{𝐸, 𝐹} → {𝐺}, {𝐹} → {𝐼, 𝐽}, {𝐸, 𝐻} →
{𝐾, 𝐿}, 𝐾 → {𝑀}, 𝐿 → {𝑁} on 𝑅. 02 3 3
1.7 What are System Logs? 02 2 1
1.8 Define Null attribute. Mention any two scenarios where, attribute
can have null values. 02 2 2
1.9 Mention types of 𝐽𝑂𝐼𝑁 operations in relational algebra. 02 2 3
1.10 What is join selectivity? 02 2 3
1.11 What is prime attribute? Give Example. 02 2 3
1.12 Data in a database at a particular moment in time is called as
______. 01 2 4

PART-B

2 a Define Database Management Systems. Explain 3 − 𝑠𝑐ℎ𝑒𝑚𝑎

architecture for 𝐷𝐵𝑀𝑆 with a neat diagram. 08 2 1
b Identify actors on the scene for 𝐻𝑂𝑆𝑃𝐼𝑇𝐴𝐿 Data Management system
with example and discuss them each. 08 3 2

3 a Draw an 𝐸𝑅 − 𝑑𝑖𝑎𝑔𝑟𝑎𝑚 for a 𝐵𝐴𝑁𝐾 database system. Assume your

own entities and identify the following:
i) Minimum of 5 entities
ii) Attributes for each entity
iii) Identifying relationship
iv) Weak Entity
v) Cardinality ratio and participation constraints. 08 3 3
 b Consider the relational database of the following schema.
𝐿𝐼𝑉𝐸𝑆(𝑝_𝑛𝑎𝑚𝑒, 𝑠𝑡𝑟𝑒𝑒𝑡, 𝑐𝑖𝑡𝑦) 𝑊𝑂𝑅𝐾𝑆(𝑝_𝑛𝑎𝑚𝑒, 𝑐_𝑛𝑎𝑚𝑒, 𝑠𝑎𝑙𝑎𝑟𝑦)
𝐿𝑂𝐶𝐴𝑇𝐼𝑂𝑁 (𝑐_𝑛𝑎𝑚𝑒, 𝑐𝑖𝑡𝑦) 𝑀𝐴𝑁𝐴𝐺𝐸𝑆 (𝑝_𝑛𝑎𝑚𝑒, 𝑚𝑔𝑟_𝑛𝑎𝑚𝑒)
Give an expression in the relational algebra for each query:
i) Retrieve all person names who live in 𝐵𝐴𝑁𝐺𝐴𝐿𝑂𝑅𝐸.
ii) Retrieve the name and salary of all the persons who work
for the company ′𝐻𝑃′.
iii) List the names of the persons working for 𝐻𝑃 along with
the cities they live in.
iv) Find the names of the persons who live and work in the
same city.
v) Retrieve the city of 𝐼𝑁𝐹𝑂𝑆𝑌𝑆 company.
vi) Display all the employees who live in “𝐵𝑎𝑛𝑔𝑎𝑙𝑜𝑟𝑒” and
works for "𝐼𝑁𝐹𝑂𝑆𝑌𝑆". 08 3 3

OR

4 a Illustrate the steps involved in 𝐸𝑅 − 𝑡𝑜 − 𝑅𝑒𝑙𝑎𝑡𝑖𝑜𝑛𝑎𝑙 Mapping. 08 3 2

b Solve the following operations by considering the tables given below:
𝑋 𝑌
𝑷 𝑸 𝑹 𝑺 𝑹 𝑺 𝑻
1 2 3 4 1 2 4
2 2 5 1 3 4 1
3 4 2 6 5 1 6
4 2 5 3 4 2 3
i) 𝑋∗𝑌
ii) 𝑋 ⊳⊲𝑋.𝑆=𝑌.𝑆 𝑌
iii) 𝑋 ⊳⊲𝑋.𝑃=𝑌.𝑇 𝑌
iv) 𝑋 ⊳⊲𝑋.𝑆=𝑌.𝑆 𝑌 08 3 3

5 a Consider the following relational schema

𝐵𝑂𝑂𝐾
𝐼𝑆𝐵𝑁 𝐵𝑜𝑜𝑘_𝑇𝑖𝑡𝑙𝑒 𝐶𝑎𝑡𝑒𝑔𝑜𝑟𝑦 𝑃𝑟𝑖𝑐𝑒 𝐶𝑜𝑝𝑦𝑟𝑖𝑔ℎ𝑡_𝑑𝑎𝑡𝑒 𝑌𝑒𝑎𝑟 𝑃𝑎𝑔𝑒_𝑐𝑜𝑢𝑛𝑡 𝑃_
𝑃𝑈𝐵𝐿𝐼𝑆𝐻𝐸𝑅
𝑃_𝐼𝐷 𝑃𝑛𝑎𝑚𝑒 𝐴𝑑𝑑𝑟𝑒𝑠𝑠 𝑆𝑡𝑎𝑡𝑒 𝑃ℎ𝑜𝑛𝑒 𝐸𝑚𝑎𝑖𝑙 − 𝐼𝐷
𝐴𝑈𝑇𝐻𝑂𝑅
𝐴_𝐼𝐷 𝐴𝑛𝑎𝑚𝑒 𝐶𝑖𝑡𝑦 𝑆𝑡𝑎𝑡𝑒 𝑍𝑖𝑝 𝑃ℎ𝑜𝑛𝑒 𝑈𝑅𝐿
𝐴𝑈𝑇𝐻𝑂𝑅 𝐵𝑂𝑂𝐾
𝐴_𝐼𝐷 𝐼𝑆𝐵𝑁
𝑅𝐸𝑉𝐼𝐸𝑊
𝑅_𝐼𝐷 𝐼𝑆𝐵𝑁 𝑅𝑎𝑡𝑖𝑛𝑔
Solve the following queries using SQL:
i) To retrieve Name, City and URL of the author whose name
is ′𝑅𝑎𝑚𝑎 𝑘𝑎𝑟𝑎𝑛′
ii) To retrieve title & price of all the textbooks with page count
greater than 500
iii) To retrieve the details of all the authors whose name ends
with the characters 𝑖𝑛
iv) TO retrieve the book categories for which number of books
published is less than 5
v) TO retrieve the details of books belonging to category with
page count greater than 300 08 3 2
b Explain the 2𝑁𝐹 and 3𝑁𝐹 with examples. 08 2 2
 OR

6 a Let 𝑅 = 𝐴𝐵𝐶𝐷𝐸, 𝑅1 = 𝐴𝐷, 𝑅2 = 𝐴𝐵, 𝑅3 = 𝐵𝐸, 𝑅4 = 𝐶𝐷𝐸, and 𝑅5 = 𝐴𝐸.

Let the functional dependencies be: 𝐴 → 𝐶, 𝐵 → 𝐶, 𝐶 → 𝐷, 𝐷𝐸 → 𝐶,
𝐶𝐸 → 𝐴. Verify whether the given decomposition of 𝑅 into
{𝑅1, 𝑅2, 𝑅3, 𝑅4, 𝑎𝑛𝑑 𝑅5} is lossless join decomposition or not. 06 4 4
b Explain aggregate operations in 𝑆𝑄𝐿 with examples. 06 2 3
c Let 𝑅 be the relation given by 𝑅 (𝑃𝑒𝑟𝑠𝑜𝑛_𝑖𝑑, 𝑁𝑎𝑚𝑒, 𝐴𝑑𝑑𝑟𝑒𝑠𝑠,
𝑀𝑜𝑏𝑖𝑙𝑒_𝑛𝑢𝑚, 𝐻𝑜𝑏𝑏𝑦). Assume that the following functional
dependencies and multivalued dependencies hold on 𝑅.
𝑃𝑒𝑟𝑠𝑜𝑛_𝑖𝑑 → 𝑎𝑑𝑑𝑟𝑒𝑠𝑠, 𝑁𝑎𝑚𝑒;
𝑃𝑒𝑟𝑠𝑜𝑛_𝑖𝑑 ↠ 𝑀𝑜𝑏𝑖𝑙𝑒_𝑁𝑢𝑚;
𝑃𝑒𝑟𝑠𝑜𝑛_𝑖𝑑 ↠ 𝐻𝑜𝑏𝑏𝑦. Decompose Relation 𝑅 into 4 𝑁𝐹. 04 4 3

7 a Justify with reasons that, the given schedules are recoverable and
conflict serializeable or not.
𝑆1 = 𝑟1(𝐴), 𝑤2(𝐴), 𝑟1(𝐵), 𝑐1, 𝑤3(𝐵), 𝑟3(𝐵), 𝑤3(𝐴), 𝑐3, 𝑟2(𝐶), 𝑐2
𝑆2 = 𝑟1(𝐴), 𝑤2(𝐵), 𝑟1(𝐵), 𝑐1, 𝑐2
𝑆3 = 𝑟1(𝐴), 𝑤1(𝐴), 𝑟2(𝐴), 𝑟1(𝐵), 𝑤2(𝐴), 𝑐2, 𝑎1
𝑆4 = 𝑟1(𝐴), 𝑤1(𝐴), 𝑟2(𝐴), 𝑟1(𝐵), 𝑤2(𝐴), 𝑐2, 𝑎1 08 5 4
b Illustrate the following with respect to execution of transactions with
examples:
i) Rules for Binary locking scheme
ii) Share and Exclusive locks 08 2 4

8 a Explain Peer-to-peer Replication with a neat diagram. 08 2 4

b Illustrate different phases of 𝐴𝑅𝐼𝐸𝑆 algorithm. 08 2 4