02000CST204052102

Total Pages: 3
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
Scheme for Valuation/Answer Key
Scheme of evaluation (marks in brackets) and answers of problems/key
FOURTH SEMESTER B.TECH DEGREE EXAMINATION July 2021 (2019 Scheme)
Course Code: CST204
Course Name: Database Management Systems
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries 3 marks) Marks

1 Any three Database users – 0.5 marks each. 3

one important characteristic of each category - 0.5 marks each.
2 Give any three points 3
3 Entity Integrity - 1.5 marks 3
and its importance -1.5 marks
4 Distinguish with example- 1 mark each 3
5 Trigger=2 marks Example= 1mark 3
6 DDL & DML with example 3
7 Any valid three points 3
8 Explanation of functional dependency(which gives two FDs equivalent) 3
9 Two-phase locking 3
10 Explain with concurrency control 3
PART B
(Answer one full question from each module, each question carries 14 marks)

Module -1
11 a) Entity sets Entities = 1 mark; Relationships = 1 mark; 7
suitable attributes = 1mark; keys = 1 mark;
ER Diagram- 3 marks
b) Explanation=4marks, Diagram=3marks 7
12 a) Database architecture explanation-4 marks, Diagram-3 marks 7
b) Explanation=4 marks, example=3 marks 7
Module -2
13 a) Correct expressions 8

Page 1 of 3
 02000CST204052102

∏NAME (σGENEDER=’F...’ (STUDENT)) 2 marks

∏NAME, PNAME(STUDENT⋈ PROFESSOR) 3 marks

ADVISOR=PROFID
This query can be answered using the difference operator in multiple-
steps as follows: 3 marks
ROLLNO-NOT-ENROLLED(ROLLNO)←∏ROLLNO(STUDENT)−
∏ROLLNO(ENROLLMENT)
STUDENT-NOT-ENROLLED(ROLLNO,NAME)←∏ROLLNO,NAME
(ROLLNO-NOT-ENROLLED*STUDENT)
In a single step the query can be,
∏ROLLNO,NAME((∏ROLLNO(ENROLLMENT)-
∏ROLLNO(ENROLLMENT))*STUDENT)
Note: The primary keys are not underlined/mentioned.
So the students can take proper assumption on the key for each table
for STUDENT table ROLLNO will be the key
for COURSE table COURSEID will be the key
for PROFESSOR table PROFID will be the key
for ENROLLMENT table ROLLNO + COURSEID will be the key

b) Left outer join with example (2 marks), 6

Right outer join with example (2 marks),
Full outer join with example (2 marks)
14 a) a) Specify the foreign keys (3 marks), 9
b) Relation algebra expression (3 marks),
c) Relation algebra expression (3 marks)
Note: keys should be identified by the students as they are not directly
mentioned.
b) Any five data types 5
Module -3
15 a) Structure - 1.5 marks each (3 marks), 5
Difference ( 2 marks)
b) Different types (3 marks), 9
Explanation (6 marks)
16 a) Static and dynamic hashing (3 marks) 9

Page 2 of 3
 02000CST204052102

differences (6 marks)
b) Correlated and non-correlated nested queries– 2.5 marks each 5
Module -4
17 a) (a) What are Armstrong’s axioms -3 marks, 10
(b) Algorithm to compute the attribute closure of a set of attributes -4
marks,
(c) Three uses of attribute closure algorithm -3 marks
b) Differences-3 marks, example-1 mark 4
18 a) Key for R-3 marks, 9
Decompose R into 2NF and then 3NF relations-6 marks
b) Lossless join property of decomposition-2.5 marks, 5
importance-2.5 marks
Module -5
19 a) Log-Based Recovery-5 marks 10
Deferred Database Modification-5 marks
b) Any valid four points 4
20 a) Difference between serial and concurrent schedules -5 marks, 10
conflict serializability – 3 marks
example-2 marks
b) Properties-2 marks, 4
Explanation-2 marks
*********

Page 3 of 3