18CS53

USN
RV COLLEGE OF ENGINEERING®
(An Autonomous Institution affiliated to VTU)
V Semester B. E. Examinations Jan/Feb-21
COMMON FOR CS / IS
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

1 1.1 A relational database consists of a collection of ______. 01

1.2 The term ______ is used to refer a row. 01
1.3 A domain is Atomic if elements of the domain are considered to be
______ unit. 01
1.4 In SQL the spaces at the end of the strings are removed by ______
function. 01
1.5 If we want to retain all duplicates, we must write ______ in place of
Union. 01
1.6 What is an Entity? 01
1.7 What are ACID properties? 02
1.8 List different types of notations used for Attribute representation in
E-R diagram. 02
1.9 If a relation is in BCNF, then the relation should be ______. 01
1.10 List all cordinality ration representation in E-R diagram. 02
1.11 Define Sharding. 01
1.12 List three layers in 3-scheme architecture. 02
1.13 Define Serialization. 01
1.14 List types of locks used in concurrency control. 02
1.15 Define Namespace. 01

PART-B

2 a Define Database. Explain the characteristics of Database 05

b Explain the following
i) Weak entity ii) Structural constraints iii) Instance
iv) Schema v) Recursive Relationship 05
c Discuss the characteristics of relational Database model with
example. 06

3 a Design E-R diagram for keeping track of information about “Banking”

Database taking into account atleast FIVE entities. 05
b List and explain Integrity constraints 05
c Discuss the different types of update operation on relational database
with an example. 06

OR
4 a Consider the following schema
𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆 (𝑠𝑠𝑠𝑠𝑠𝑠; 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠, 𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟, 𝑎𝑎𝑎𝑎𝑎𝑎)
𝐵𝐵𝐵𝐵𝐵𝐵𝐵𝐵𝐵𝐵 (𝑏𝑏𝑏𝑏𝑏𝑏, 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏, 𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐)
𝑅𝑅𝑅𝑅𝑅𝑅𝑅𝑅𝑅𝑅𝑅𝑅𝑅𝑅𝑅𝑅 (𝑠𝑠𝑠𝑠𝑠𝑠, 𝑏𝑏𝑏𝑏𝑏𝑏, 𝑑𝑑𝑑𝑑𝑑𝑑)
Obtain the relational algebra queries for following
i) Find the name of sailors who reserved green boat.
ii) Find the color of the boat reserve by “Naresh”.
iii) Find the name of the sailor who has reserved boat 1. 06
b Explain the three-tier architecture with a neat diagram. 05
c Derive intersection and division operations using complete set of
relational algebra operations. 05

5 a Apply the minimal cover algorithm for the following functional

dependency.
F :{ A→ 𝐵𝐵𝐵𝐵𝐵𝐵𝐵𝐵, 𝐶𝐶𝐶𝐶 → 𝐸𝐸 } 05
b Verify whether the following functional dependencies are equivalent.
F :{ A→ 𝐶𝐶, 𝐴𝐴𝐴𝐴 → 𝐷𝐷, 𝐸𝐸 → 𝐻𝐻 },
G:{ → 𝐶𝐶𝐶𝐶, 𝐸𝐸 → 𝐴𝐴𝐴𝐴 } 06
c Consider the following schema and obtain the SQL queries.
𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆 (𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠_𝑖𝑖𝑖𝑖, 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠, 𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚, 𝐺𝐺𝐺𝐺𝐺𝐺)
𝐹𝐹𝐹𝐹𝐹𝐹𝐹𝐹𝐹𝐹𝐹𝐹𝐹𝐹 (𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓_𝑖𝑖𝑖𝑖, 𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓, 𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑. , 𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑, 𝒔𝒔𝒔𝒔𝒔𝒔)
𝐶𝐶𝐶𝐶𝐶𝐶𝐶𝐶𝐶𝐶𝐶𝐶 (𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐_𝑖𝑖𝑖𝑖, 𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐, 𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓_𝑖𝑖𝑖𝑖)
𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸 (𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐_𝑖𝑖𝑖𝑖, 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠_𝑖𝑖𝑖𝑖, 𝑔𝑔𝑔𝑔𝑔𝑔𝑔𝑔𝑔𝑔)
i) List the names of all students enrolled for the course ‘CS_53’
ii) List the names of students enrolled for the course ‘CS_53’ and
have received ‘A’ grade.
iii) List all the department having an average salary of above
Rs. 20000.
iv) List the names of all faculty members beginning with “R” and
ending with “U”. 05

OR

6 a Consider the following schema and obtain the SQL queries.

𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸 (𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓, 𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙, 𝑆𝑆𝑆𝑆𝑆𝑆, 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏, 𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎, 𝑠𝑠𝑠𝑠𝑠𝑠, 𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆𝑆, 𝑑𝑑𝑑𝑑𝑑𝑑)
𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃 (𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓𝑓, 𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃, 𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃, 𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑)
𝑊𝑊𝑊𝑊𝑊𝑊𝑊𝑊𝑊𝑊𝑊𝑊𝑊𝑊 (𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒, 𝑝𝑝𝑝𝑝𝑝𝑝, ℎ𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜)
𝐷𝐷𝐷𝐷𝐷𝐷𝐷𝐷𝐷𝐷𝐷𝐷𝐷𝐷𝐷𝐷𝐷𝐷𝐷𝐷 (𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑, 𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑, 𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚, 𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚)
i) Find the sum of salaries of all employees, the maximum salary,
minimum salary.
ii) Retrieve the total number of employees in the company and
number of employees in Research dept. 06
iii) For each dept., retrieve dept. number, number of employees in
dept. and their average salary.
b Consider the following functional dependencies
𝑆𝑆𝑆𝑆𝑆𝑆 → 𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸𝐸,
Pnumber → {Pname, Plocation} {𝑆𝑆𝑆𝑆𝑆𝑆, 𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃} → ℎ𝑜𝑜𝑜𝑜𝑜𝑜𝑜𝑜
Find the closure for the set of attributes under this set of FD’s.
{𝑆𝑆𝑆𝑆𝑆𝑆}+ = ?
𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃+ =?
{𝑆𝑆𝑆𝑆𝑆𝑆, 𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃𝑃}+ =? 06
c Consider the following table 05
CID CTitle Faculty_ID Faculty_name
Find whether the table is in 1NF, 2NF and 3NF? If not Normalize the
table.
7 a Check whether the given schedule is conflict serializable or not.
𝑆𝑆: 𝑅𝑅1(𝐴𝐴), 𝑅𝑅2(𝐴𝐴), 𝑅𝑅1(𝐵𝐵), 𝑅𝑅2(𝐵𝐵), 𝑅𝑅3(𝐵𝐵), 𝑊𝑊1(𝐴𝐴), 𝑊𝑊2(𝐵𝐵) 06
b Check whether the given schedule S is conflict serializable and
recoverable or not.
T1 T2 T3 T4
R(X)
W(X) W(X)
COMMIT COMMIT
W(Y)
R(Z)
COMMIT
R(X)
R(Y)

COMMIT 06
c List and explain desirable properties (ACID) of transaction database 05

8 a Demonstrate with examples Aggregate data models. 06

b Discuss sharding and Namespace with respect to MongoDB. 05
c Demonstrate Peer-peer replication with an example. 05