Course Code: Course Title Credit

CSC403 Database Management System 3

Prerequisite: Data Structures

Course Objectives:
1 |Develop entity relationship data model and its mapping to relational model
Learn relational algebra and Formulate SQL queries
3 Apply normalization techniques to normalize the database
4 Understand concept of transaction, concurrency control and recovery techniques.
Course Outcomes:
1|Recognize the need of database management system
2 Design ER and EER diagram for real life applications
3 Construct relational model and write relational algebra queries.
Formulate SQL queries
5 Apply the concept of normalization to relational database design.
6Describe the concept of transaction, concurrency and recovery.

Module Content Hrs

Introduction Database Concepts 3

Introduction, Characteristics of databases, File system v/s Database system,

Data abstraction and data Independence, DBMS system architecture,
Database Administrator
2 Entity-Relationship Data Model 6

2.1 The Entity-Relationship (ER) Model: Entity types: Weak and strong entity
sets, Entity sets, Types of Attributes, Keys, Relationship constraints:
Cardinality and Participation, Extended Entity-Relationship (EER) Model:
Generalization, Specialization and Aggregation
3 Relational Model and relational Algebra 8

31| Introduction tothe Relational Model, relational schema and concept of keys
Mapping the ER and EER Model to the Relational Model, Relational
Algebra-operators, Relational Algebra Queries.
4 Structured Query Language (SQL) 6

4 1|Overview of SQL, Data Definition Commands, Integrity constraints: key

constraints, Domain Constraints, Referential integrity , check constraints,
Data Manipulation commands, Data Control commands, Set and string
operations, aggregate function-group by, having, Views in SQL, joins,
Nested and complex queries, Triggers
5 Relational-Database Design 6

5.1 Pitfalls in Relational-Database designs, Concept of normalization, unction

Dependencies, First Normal Form, 2NE, 3NE, BCNE
6 Transactions Management and Concurrency and Recovery 10

61|Transaction concept, Transaction states, ACID properties, Transaction

Control Commands, Concurrent Executions, Serializability-Conflict and
View, Concurrency Control: Lock-based, Timestamp-based protocols,
Recovery System: Log based recovery, Deadlock handling
 7
4D

7
4D
75
23

23
Paper / Subject Code: 40523 / Database Management System

84

7Y
DX

84

DX
75

75
23

23
44

44
7Y

7Y
DX

DX
58

58
23

23
Y7

44

Y7

44
DX

DX
[Time: 3 Hours] [ Marks: 80]

58
7

58
7
3

3
44

7
2

7
2
7Y
DX

7Y
DX
58

8
N.B. : (1) Question No 1 is Compulsory.

75
23

3
Y7

7
X2
(2) Attempt any three questions out of the remaining five.

Y
X

Y
8
37

8
37
D

37
75

D
75
(3) All questions carry equal marks.

X2

44

44

2
Y

Y
X
(4) Assume suitable data, if required and state it clearly.

DX
8
7

8
4D

37
4D
5
3

5
7
X2

7
2

4
84

84

Y
X

84
37
D

37
75

4D
5

75
1 Attempt any FOUR [20]

7
X2

2
7Y

4
4

7Y

Y
DX

4
58

58

58
4D
a Compare File Processing System with Database Management system

7
05
23

3
7

7
X2

44

Y7
X2
Y
DX

Y
8
b T1 T2 37 05

8
37
D

37
75

D
75
44

4
read(A)

X2

X2
7Y
DX

4
58

8
A := A − 50

8
7
D
75

4D
3

75
3
Y7

44

X2
read(A)

2
Y
DX

84
8

DX
37

8
7

7
75

temp := A ∗ 0.1

4D
5
23

5
23
X2

44

Y7

Y7
Y

44
A := A − temp
X

X
58
7

8
4D

58
D

7
4D
3

75
3
write(A)

3
Y7
X2

X2

Y7
84

X2
4

84
read(B)
58
37
D

37
75

4D

37
4D
75
4

write(A)
7
X2

2
7Y

84

X2
Y

84

Y
X

4
read(B)
37

58
4D

37
75

D
23

75

4D
2

B := B + 50
4

Y7
X2
Y
DX

Y
DX

84

84
8
7

write(B)

37
75

4D
3

75
3

75
44

commit

X2
7Y
DX

Y
DX

7Y
58

58
7

B := B + temp
5

4D
3

23
Y7

44

23
7
2

44

Y7
7Y
X

write(B)
X

84
58

DX
37

58
D

7
D
23

commit
75
3
7
X2

44

44

X2
Y

44
Y
X

7Y

Draw the precedence graph for above schedule?

58
7

58
4D

37

58
D

D
23

23
7

7
X2

Y7
84

c Define with an example different type of Entities in ER diagram 05

X

84

DX
58
37
D

37
75

37
75
4

7
2

d Define Triggers. Write syntax and example of trigger. 05

2

44
84

X2
Y
X

84

Y
X
7

58
4D

7
5

4D
75

4D
3

e Explain five aggregate functions of SQL with example? 05

3
Y7

7
2
4

Y
DX

7Y
X

84
8
7

8
7
75

D
23

75
3

75
3
44

44

2
7Y
X

7Y
DX

7Y
DX
58

2 a Design an EER diagram for Hospital Management System. And map it into [10]
58
4D

23
Y7
X2

44

7
X2

44
Y

relational model. Assume Suitable data.

DX
58
37

58
D

37
D
44

Y7
X2

44

Y7

b Brief overall database architecture with suitable diagram.

X2

[10]
44
58

8
37

58
4D

7
4D
5

3
7

7
2

Y7
X2
7Y

Y
DX

84
8

37

37
75

4D

Consider the following employee database.

23

3 a [10]
75
44

X2
Y

7Y
DX

84
8

Employee (empname, street, city, date_of_joining)

37

75

4D
75
3
2

44

X2
7Y
DX

7Y

Works (empname, company_name,salary)

84
58

D
23

75
23
44

Y7

44

Company (company_name, city)

X

7Y
DX
58

58
37
4D

23
Y7

Manages (empname, manager_name)

Y7
X2

44
84

DX
58
37
4D
5

Write the SQL queries for each of the statements given below
Y7

Y7
2

44
84

DX
37

58
7
5

23
Y7
2

44

Y7
DX

DX

54735 Page 1 of 2
58
37

37
44

Y7
X2

44

X2
58
37
4D

4D
Y7
X2

X237Y75844DX237Y75844DX237Y75844DX237Y75844D
84

84
 7
4D

7
4D
75
23

23
Paper / Subject Code: 40523 / Database Management System

84

7Y
DX

84

DX
75

75
23

23
44

44
7Y

7Y
DX

DX
58

58
23

23
Y7

44

Y7

44
DX

DX
a) Modify the database so that ‘John’ now lives in ‘Mumbai’.

58
7

58
7
3

3
44

7
2

7
2
7Y
DX

4
b) Find all employees who joined in the month of October.

7Y
DX
58

8
75
23

3
Y7

4
c) Give all employees of ‘ABC Corporation’ a 10% raise.

7
X2
4

Y
X

Y
8
37

8
37
D

37
75

D
75
d) Find all employees in the database who live in the same cities

X2

44

44

2
Y

Y
X

DX
8
7

8
4D

37
4D
5
as the companies for which they work

5
7
X2

7
2

4
84

84

Y
X

84
37
e) Find all employees who earn more than average salary of all

37
75

4D
5

75
4

7
X2

2
7Y

4
4

7Y

Y
DX

4
employees of their company

58

58

58
4D

7
23

3
7

7
X2

44

Y7
X2
Y
b Explain following relational algebra operators with example
DX

[10]

Y
8
37

8
37
D

37
75
a) Selection operator b) Union operator

D
75
44

X2

X2
7Y
DX

Y
c) Rename operator d) Cartesian product

4
58

8
7
D
75

4D
3

75
3
Y7

44

X2

2
Y
DX

84
8

DX
37

8
7

7
75

4D
5
23

5
23
4 a Explain concurrency control and explain time Stamp based protocol of concurrency [10]
X2

44

Y7

Y7
Y

44
X

X
58
7

8
4D

58
D
control.

7
4D
3

75
3

3
Y7
X2

X2

Y7
84

X2
4

84
b Why there is need of normalization? Explain 1NF,2NF,3NF and BCNF with [10]
58
37
D

37
75

4D

37
4D
75
4

7
X2

2
7Y

84

X2
Y

examples.
84

Y
X

4
37

58
4D

37
75

D
23

75

4D
2

Y7
X2
Y
DX

Y
DX

84

84
8
7

37
75

4D
3

75
3

75
44

5 a Describe ACID properties with examples and explain state transition diagram of [10]
2

X2
7Y
DX

Y
DX

7Y
58

58
7
5

transaction.
4D
3

23
Y7

44

23
7
2

44

Y7
7Y
X

84
58

DX
37

58

b What is Deadlock. Explain wait-die and wound-wait methods with suitable [10]
D

7
D
23

75
3
7
X2

44

44

X2
Y

44
Y
X

7Y

example.
58
7

58
4D

37

58
D

D
23

23
7

7
X2

Y7
84

Y
X

84

DX
58
37
D

37
75

37
75
4

7
2

Attempt any two

4

6
2

44
84

X2
Y
X

84

Y
X
7

58
4D

7
5

4D
75

4D
3

a Explain in detail with example of conflict and view serializability . [10]

3
Y7

7
2
4

Y
DX

7Y
X

84
8
7

8
7

b Explain following Integrity constraints: [10]

75

D
23

75
3

75
3
44

44

2
7Y

a) Key Constraints.
X

7Y
DX

7Y
DX
58

58
4D

b) Domain Constraints (Null & Default Constraints).

3

23
Y7
X2

44

7
X2

44

c) Referential Constraints.
Y

DX
58
37

58
D

37
D

d) Check Constraints.
44

Y7
X2

44

Y7
X2

44

c Write short note on Log based recovery mechanism [10]

58

8
37

58
4D

7
4D
5

3
7

7
2

Y7
X2
7Y

______________________
4

Y
DX

84
8

37

37
75

4D
23

75
44

X2
Y

7Y
DX

84
8
37

75

4D
75
3
2

44

X2
7Y
DX

7Y

84
58

D
23

75
23
44

Y7

44
X

7Y
DX
58

58
37
4D

23
Y7

Y7
X2

44
84

DX
58
37
4D
5
Y7

Y7
2

44
84

DX
37

58
7
5

23
Y7
2

44

Y7
DX

DX

54735 Page 2 of 2
58
37

37
44

Y7
X2

44

X2
58
37
4D

4D
Y7
X2

X237Y75844DX237Y75844DX237Y75844DX237Y75844D
84

84
 €,*W u- Papcr / Subject Code: 40523/ Datatrase l\Ianagement S,r,stem

gE Sa,^lV /gq
'r / )Cf1 LS /,t1or-{zoz3
(omP) rr- '
nurutiolr, IrVrax Marks:Sol

N.B.: (t)QrrestionNo I isComputsory. d p .: Z:JBB3

(2) Attempt aly three questions out of the remaining five.
(3) All quest.ions carry equal marks.
(4) Assume suitable data, if required and state it clearly.

1 Attempt any FOUR

120tr
a Identift different ofdatabase system
b Convert schema

\*

lv

[10]

[101

[101

tl
 6 \\'rite short note on the following (Any four)
[201
a Colversion of specialization to relational schema with suitable example
' [0s]
b Types of attiibutes ,, . ::
[0sl
[0sl
.
d Triggers ,..-1

e...".
tssl
!''"1',.'
[0sl

rr,'

::. ,
2989J; " Page 2 of2

822566 1 7E3BF5E 1 89C93886967AC45E4

 Paper i Subject Code: 40523 I

Se Cr"r,rf l2-],'L 3
5 s-s
N.B.: JN;

(2) Attempt any three questions

(3) All questions carry equal

(4) Assume suitable data,

1
[20]
.a t5t
L- J

b
,r [S.l
L"t

c t5l
d tsl
e tsl

of [10]
and suitable [10]

t10l

Relational suitable example" t1 0l

A

,*;'
Paper / Subject Code: 40523 I Systerfr
",::;,'
-ll

4a Consider the following employee

Employee (e!Sp!grng. street, city,

Works (empname,
Company (comoany_name,

Write SQL queries for

l. Modify SO 'John' lives
2. Find joined
3. 0%
4. of all
ltj ,

1',{

5.. letter."A"
b [1

a t10l
b t10l

,:$ [20]
a [0s]
[05]
t0sl
[0s]
[0s]
 Paper/ Subject Code: 40523 /
See cbMr\ E€4-1:w\ p-tq\
[Time:3

Instructions
8r t
i.
(l) Q.l is Compulsory.
(2) Solve any three from
(3) Draw neat diagrams

Q.l a) Whatisdata
b) Draw Extended

Q.2 a) Explain
b) Write
Consider
(_ i)
ii)
ii i)
name
iv)

What
(10)
(10)

with (10)
(10)

(20)

TCL

.{

I
i.
I

B
Page 1 of 1

1 F260 8 C3 04A 20 A42 I 3 2EF 840 8 0E 8 E9 9D