Reg No.: Name:

Max. Marks: 100

E4810 Pages: 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
FOURTH SEMESTER B.TECH DEGREE EXAMINATION, APRIL 2018
Course Code: CS208
Course Name: PRINCIPLES OF DATABASE DESIGN (CS, IT)

Limit answers to the required points.
PART A
Answer all questions, each carries 3 marks.
List any three categories of database users, highlighting any one important

characteristic of each category.

In a relationship of degree 2, how can we decide if an attribute of the
relationship can be moved to one of the entity sets?

Give suitable examples for multi-valued, composite and multi-valued composite
attributes.

Given the relations PROFESSOR(PID,PNAME, DEPT, SALARY) and
STUDENT(ROLLNO, NAME, CLASS, ADVISER) where ADVISER is a foreign
key to PROFESSOR, write one equivalent relational algebra expressionfor each

of the following:
1. TIPNAME (OsaLary>30000 (PROFESSOR))

1. ThsNAME(Opert=’cse (STUDENT ®!PROFESSOR))
ADVISER=PID

PART B
Answer any two full questions, each carries 9 marks.
a) Distinguish between 10101 and partial participation constraints with the help

of real examples.
b) Describe the real-world situation described by the following ER diagram.

ಹಾ ‏کہجحس ٹج‎
(1400) COURSE# )
‏ہرم‎ i ത്യം
‏تسيل‎ (0७) ‏کے‎ ` (1.3) eS
C NAME > PROFESSOR/—— TEACHES ‏لح‎ course | COURSE NAME 2
AME न COURSE NAME.

1

c) Re-draw the ER diagram in 5(b) replacing the (min,max) notation with the
conventional notation showing cardinality and participation.
The relational schema for a library describing members, books and issue
information is given below. Foreign keys have the same name as primary
keys.
BOOKS(ACC-NO, ISBN, TITLE, EDITION, YEAR)

Page 1of 4

Duration: 3 Hours

Marks

(3)
(3)
(3)

(3)

(4)
(3)

(2)