16CS52 / 12CS54

USN
RV COLLEGE OF ENGINEERING®
(An Autonomous Institution affiliated to VTU)
V Semester B. E. Fast Track Examinations Oct-2020
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

1 1.1 For each attribute of a relation there is a set of permuted values,

called the _________ of the attribute. 01
1.2 Characteristic of 𝐷𝐵𝑀𝑆 which allows program operation independence
and program data independence is called _________. 01
1.3 Following table has two attributes 𝐴 and 𝐶 where 𝐴 is the primary key
and 𝐶 is the foreign key referencing 𝐴 with on delete cascade:
𝐴 𝐶
2 4
3 4
4 3
5 2
7 2
9 5
6 4
The set of tuples that must be additionally deleted to preserve
referential integrity when the tuple (2,4) is deleted 02
1.4 If 𝐸 and 𝐸 be two entities in an 𝐸𝑅 diagram with single-valued
attributes 𝑅 and 𝑅 are two relationships between 𝐸 and 𝐸 ,where 𝑅
is one-to many and 𝑅 is many-to-many. 𝑅 and 𝑅 do not have any
attributes on their own. What is the minimum number of tables
required to represent this selection in the relational model? 02
1.5 Consider the relations 𝑟 (𝑃, 𝑄, 𝑅), 𝑟 (𝑅, 𝑆, 𝑇) with primary keys 𝑃 and 𝑅
respectively. The relation 𝑟 contains 2000 tuples and 𝑟 contains 2500
tuples. The max size of the form 𝑟 ⋈ 𝑟 is _________. 02
1.6 Consider the following relational schemes for the library database:
𝐵𝑜𝑜𝑘(𝑇𝑖𝑡𝑙𝑒, 𝐴𝑢𝑡ℎ𝑜𝑟, 𝐶𝑎𝑡𝑎𝑙𝑜𝑔_𝑛𝑜, 𝑃𝑢𝑏𝑙𝑖𝑠ℎ𝑒𝑟, 𝑌𝑒𝑎𝑟, 𝑃𝑟𝑖𝑐𝑒)
𝐶𝑜𝑙𝑙𝑒𝑐𝑡𝑖𝑜𝑛 (𝑇𝑖𝑡𝑙𝑒, 𝐴𝑢𝑡ℎ𝑜𝑟, 𝐶𝑎𝑡𝑎𝑙𝑜𝑔 _𝑛𝑜. )
with the following 𝐹𝐷’𝑠
a) Title, Author → Catalog_no
b) Catalog _no → Title, Author, Publisher,year
c) Publisher, Title, Year → Price
Assume {Author, Title} is the key for both schemes which normalized
from the relation Book and collection is? 02
 1.7 Differentiate between 3𝑁𝐹 and 𝐵𝐶𝑁𝐹. 02
1.8 MangoDB is _________ database. The concatenation of the collection
name and database name is called _________. 02
1.9 The database system must take special actions to ensure that
hamstadins operate properly without interference from concurrently
executing database statements. This property is referred as _________. 02
1.10 List any two ways of searching in elastic search? 02
1.11 What is check point and when does it occur? 02

PART-B
2 a If you were designing a web based system online to make airline
reservations and sell tickets, design and summarize the schema
architecture preferred by you with the help of a neat diagram. 08
b Sketch with a neat diagram, the database system environment by
mentioning 𝐷𝐵𝑀𝑆 component modules. Explain in brief. 08

3 a Draw the entity-relationship diagram for the following scenario

A sales person may manage many other salespeople.
A sales person is managed by only one salespeople.
A sales person can be an agent for many customers.
A customer is managed by one salespeople. A customer may place
many orders. An order can be placed by one customer. An order lists
many inventory items. An inventory item may be listed on many
orders.
An inventory item is assembled from many parts. A part may be
assembled into many inventory items Many employees assemble an
inventory item from many parts. A supplier supplies many parts. A
part may be supplied by many suppliers. Apply the cardinals ratio for
the 𝐸𝑅 diagram. 08
b Consider the following schema:
Student(SID, SurName, first Name, Campus, email, cgpa)
Course(dept, CNum, name, breadth)
offering(OID, dept, CNum, term, instructor)
Took(SID, OID, grade)
Note: A course may or may not satisfy the “breadth requirement”
Write a relational algebraic queries for the following
i) Retrieve the names of all students who have passed a
breadth course with professor picky.
ii) Retrieve the SID of students who have earned a grade of 85
or more, or who have passed a course taught by Atwood. 08
OR

4 a Consider the following schema: Write the relational algebraic

expression for the following queries.
Suppliers(sid:integer, sname:string, address:string)
parts: (pid:integer, pname:string, color:string)
catalog(sid:integer, pid:integer, cas:real)
i) Find the pids of the most expensive part supplied by the
supplier “yoremite sham”.
ii) Find pairs of sids such that the supplier with the first sid
charges more for some part than the supplier with the
second sid. 08
 b Derive intersection and diversion operation from complete set of
relational algebra operations. 08

5 a Consider the following schema

employee(employee_name, street, city)
works(employee_name,company_name,salary)
company(company_name,city)
manager(employee_name,manager name)
Write nested 𝑆𝑄𝐿 query for the following
i) Find the names, street address and cities of residence of all
employees who work for First Bank corporation and earn
more than $10,000
ii) Find all companies located in every city in which small bank
corporation is located.
iii) Find the company that has the most employees 10
b Find the minimal cover for the following 𝐹𝐷’𝑠
𝐹 = 𝐴 → 𝐵, 𝐴𝐵𝐶𝐷 → 𝐸, 𝐸𝐹 → 𝐺, 𝐸𝐹 → 𝐻, 𝐴𝐶𝐷𝐹 → 𝐺. Show the steps needed
to find the minimal cover? 06
OR

6 a Consider the relation 𝑅 = {𝐴, 𝐵, 𝐶, 𝐷, 𝐸, 𝐹, 𝐺, 𝐻, 𝐼, 𝐽} and a set of 𝐹𝐷’𝑠

𝐹 = 𝐴, 𝐵 → 𝐶, 𝐴 → 𝐷, 𝐸, 𝐵 → 𝐹, 𝐹 → 𝐺, 𝐻, 𝐷 → 𝐼, 𝐽
What is the key for 𝑅? Decompose 𝑅 into 2𝑁𝐹 and then to 3𝑁𝐹 06
b Given the following schema:
employees(emp_id, first_name, last_name, hire_date, dept_id, salary)
department(dept_id, dept_name, manager_id, location_id)
Write a 𝑆𝑄𝐿 query to display the last names and hire dates of all latest
hires in their respective departments in the location 𝐼𝐷1700 06
c Explain correlated query with example. 04

7 a Explore the advantages of MongoDB over 𝑅𝐷𝐵𝑀𝑆. 06

b Create a database ‘student’ in MongoDB and insert a row in it. 02
c Discuss the concepts of 𝑆𝐻𝐴𝑅𝐷𝑆 and 𝑅𝐸𝑃𝐿𝐼𝐶𝐴𝑆 in elastic search. 08

8 a Consider the following two transactions: 𝑇 ∝ 𝑇

𝑇 : 𝑟𝑒𝑎𝑑(𝐴); 𝑇 : 𝑟𝑒𝑎𝑑(𝐵);
𝑟𝑒𝑎𝑑(𝐵); 𝑟𝑒𝑎𝑑(𝐴);
𝑖𝑓 𝐴 = 0 𝑡ℎ𝑒𝑛 𝐵 ← 𝐵 + 1; 𝑖𝑓 𝐵 ≠ 0 𝑡ℎ𝑒𝑛
𝑊𝑟𝑖𝑡𝑒(𝐵); 𝐴 ← 𝐴 + 1;
𝑊𝑟𝑖𝑡𝑒(𝐴);
Using shared and exclusive locks, show how the above transactions
can be executed concurrently to strict 2 phase locking. 08
b Consider the following two transactions and schedule. In this
schedule conflict-serializable? Explain why or why not?
𝑇 𝑇
𝑟 (𝐴)
𝑤 (𝐴)
𝑟 (𝐴)
𝑟 (𝐵)
𝐶
𝑟 (𝐵)
𝑤 (𝐵)
𝐶 08