0% found this document useful (0 votes)
29 views4 pages

DBMS QP

The document is an examination paper for the Database Management System course, with a subject code of 38973, scheduled for December 14, 2023. It includes instructions for answering questions, a breakdown of marks, and various questions related to database concepts such as data independence, weak entities, SQL aggregate functions, and normalization. The paper requires students to attempt specific questions and provides guidelines for data assumptions and examples.

Uploaded by

rakesh8928177094
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
29 views4 pages

DBMS QP

The document is an examination paper for the Database Management System course, with a subject code of 38973, scheduled for December 14, 2023. It includes instructions for answering questions, a breakdown of marks, and various questions related to database concepts such as data independence, weak entities, SQL aggregate functions, and normalization. The paper requires students to attempt specific questions and provides guidelines for data assumptions and examples.

Uploaded by

rakesh8928177094
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

B

44

E
75

F4
AB

B9
Paper / Subject Code: 38973 / Database Management System

3E
BA

C5
42
5F
1T01874 - S.E.(Computer Science & Engineering (Artificial Intelligence and Machine Learning)

BB

9E

4
30

E4
A7

5F
FA

2B
EA
(R-2019-20)('C' Scheme) Semester - IV / 38973 - Database Management System

B3

EC
0B

4
75
FE
QP CODE: 10042559 DATE: 14/12/2023.

AB

E4

9
A3

2B
04

3
0B

5F
EE
Duration: 3hrs [Max Marks:80]

BB

44
15

A7
3
F

3E
95

FA
EA
04
N.B. : (1) Question No 1 is Compulsory.

2
F4

44
15

5
30
E

AB
A7
C5

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

3E
95

A
04

5F
EE
9E

F4

BB
5

30
51
(3) All questions carry equal marks.

A7
2B

C5

4F

FA
EA
49

B
0
44

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

75
0
FE
5F
9

1
3E

A3
2B

95

FA
EC

4
BB

0B
50

E
44

75
FE
5F
B9

1
3E

A3
FA

95

BA
C

4
42
1 Attempt any FOUR [20]

50

EE
E
75

4
AB

E4

30
5F
B9

51
BA

4F
a Explain the concept of data independence .Discuss the differences between [5]

A
3

C
2
F

49
BB

EE
44

E
75
30

15

0
5F
B9
E
logical and physical data independence
BA

A3
A
EA

4F
95
3

EC
2
F

50

EE
44
75

F4
0
FE

AB
b Describe weak entity. Provide an example of weak entity and strong entity. [5]

B9
A3

51
E
BA

C5

4F
04

2
5F
EE

49
BB

50
44
15

9E
c List and briefly explain SQL aggregate functions with suitable examples [5]
30

A7

5F
F

51
E
95

2B
EA
04

B3

EC
0B

5F

49
d Explain the concept of First Normal Form (1NF).Give example for the same. [5]
F4

44
15

FE

AB
7

5F
B9
3
C5

3E
95

BA
A
4

e Discuss conflict serializability with suitable example. [5]

EC
42
0

5F
EE
9E

F4

BB
5

30

E4
51

A7

B9
2B

C5

4F

FA
A
49

3
0B

42
0

EE
44

9E

BB
5

5
F

E4
51
3E

7
A3
2 a Describe the overall architecture of DBMS with suitable diagram [10]
2B

C5

BA

FA
04
9

B3
BB

E
44

9E

F4

15

75
0
E

b What is deadlock? Explain wait-die and wound-wait methods with suitable [10]

AB
3E

A3
FA

2B

4F
95

BA
C
BB

50

5F
EE
44

9E
75

F4

example.
0
51
3E

A7
BA

A3
FA

2B

C5

4F
49
BB

0B
0

EE
4

9E
75
30

15
E4

5F
BA

A3
FA

B
A

4F
95
B3

3 a Draw an E-R diagram for library management system. Convert it into relational [10]
EC
42
EE

50

EE
75

F4
30

AB

B9
4F

51
E
BA
EA

schema
C5

4F
3

42
50

5F

49
BB

50
9E
30
FE

E4
A7

5F

b Explain the following Relational Algebra operations with suitable example. [10]
51
A

2B
A
04

B3

EC
0B

5F
EE

49
44
15

1) Project 2) Select
AB
A7

5F
B9
A3
4F

E
95

EC
0B

42
50

5F
EE
F4

3) Union 4) Rename
AB

E4
51

A7

B9
A3
C5

4F
49

5) Set difference
0B

42
50

5F
EE

BB
5F

E4
51

A7
A3
4F

A
EC

B3
B
50

5F
EE
F4

30
B9

AB
51

7
C5

4F

BA
A
42

50

5F
EE
9E

F4
E4

30
51

A7
2B

C5

4F

A
9

0B
50

EE
44

9E

F4

51
3E

A3
2B

C5

4F
49
BB

50

EE
44

9E

5F

51
3E
FA

2B

4F
EC

49
BB

50
44
75

5F
B9

51
3E
FA

EC
42

49
BB
75

E4

5F
B9
BA

FA

B3

EC

42559 Page 1 of 2
42
75
30

AB

E4

B9
BA
EA

B3

42
5F
30

AB

E4
A7
EA

04FEEA30BA75FABB3E442B9EC5F49515
B3
0B

5F
B

44

E
75

F4
AB

B9
Paper / Subject Code: 38973 / Database Management System

3E
BA

C5
42
5F

BB

9E

4
30

E4
A7

5F
FA

2B
EA

B3

EC
0B

4
75
FE

AB

E4

9
A3

2B
04

3
0B

5F
EE

BB

44
15

A7
3
F

3E
95

FA
EA
04
4 a Consider the following employee database. [10]

2
F4

44
15

5
30
E

AB
A7
C5

F
Employee (empname, street, city, date_of_joining)

3E
95

A
04

5F
EE
9E

F4

BB
5

30
Works (empname, company_name,salary)

51

A7
2B

C5

4F

FA
EA
49

B
0
44
Company (company_name, city)

75
0
FE
5F
9

1
3E

A3
2B

95

FA
EC

4
BB

0B
50

E
44

75
FE
5F
B9

1
3E

A3
FA
Write SQL queries for the following statements.

95

BA
C

4
42
B

50

EE
E
75

4
1. Modify the database so that ‘John’ now lives in ‘Mumbai’.

AB

E4

30
5F
B9

51
BA

4F

A
3

C
2
F

49
BB
2. Find all employees who joined in the month of October.

EE
44

E
75
30

15

0
5F
B9
E
BA

A3
A
EA

4F
3. Give all employees of ‘ABC Corporation’ a 10% raise.

95
3

EC
2
F

50

EE
44
75

F4
0
FE

AB

B9
A3

51
E
4. Find all employees who earn more than average salary of all employees
BA

C5

4F
04

2
5F
EE

49
BB

50
44
15

9E
30

of their company
A7

5F
F

51
E
95

2B
EA
04

B3

EC
0B

5F
5. List name of companies starting with letter “A”

49
F4

44
15

FE

AB
7

5F
B9
3
C5

3E
95

BA
A
4

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

EC
42
0

5F
EE
9E

F4

BB
5

30

E4
51

A7

B9
2B

C5

4F

example.

FA
A
49

3
0B

42
0

EE
44

9E

BB
5

5
F

E4
51
3E

7
A3
2B

C5

BA

FA
04
9

B3
BB

E
44

9E

F4

15

75
0
E

5 a Describe ACID properties with examples [10]

AB
3E

A3
FA

2B

4F
95

BA
C
BB

50

5F
EE
44

9E
75

F4

b Explain Lock based (2PL) concurrency control method with example [10]
0
51
3E

A7
BA

A3
FA

2B

C5

4F
49
BB

0B
0

EE
4

9E
75
30

15
E4

5F
BA

A3
FA

B
A

4F
95
B3

6 Write short note on the following(Any four) [20]


EC
42
EE

50

EE
75

F4
30

AB

B9
4F

51
E
BA
EA

a Conversion of Specialization to relational schema with suitable example [05]


C5

4F
3

42
50

5F

49
BB

50
9E
30
FE

E4
A7

5F

b Log based recovery [05]


51
A

2B
A
04

B3

EC
0B

5F
EE

49
44
15

c Role of DBA [05]


AB
A7

5F
B9
A3
4F

E
95

EC
0B

42
50

5F
EE
F4

d Triggers [05]
AB

E4
51

A7

B9
A3
C5

4F
49

e Types of attributes [05]


0B

42
50

5F
EE

BB
5F

E4
51

A7
A3
4F

**************
EC

B3
B
50

5F
EE
F4

30
B9

AB
51

7
C5

4F

BA
A
42

50

5F
EE
9E

F4
E4

30
51

A7
2B

C5

4F

A
9

0B
50

EE
44

9E

F4

51
3E

A3
2B

C5

4F
49
BB

50

EE
44

9E

5F

51
3E
FA

2B

4F
EC

49
BB

50
44
75

5F
B9

51
3E
FA

EC
42

49
BB
75

E4

5F
B9
BA

FA

B3

EC

42559 Page 2 of 2
42
75
30

AB

E4

B9
BA
EA

B3

42
5F
30

AB

E4
A7
EA

04FEEA30BA75FABB3E442B9EC5F49515
B3
0B

5F
AB
Y6
X5

5
A

7X
Paper / Subject Code: 38973 / Database Management System

61

61
25
B7

AB
May 21, 2024 02:30 pm - 05:30 pm 1T01874 - S.E.(Computer Science & Engineering (Artificial

Y6

Y6
X5
1A

7X
Intelligence and Machine Learning)(R-2019-20)(’C’ Scheme) Semester - IV / 38973 - Database

61
25

25
B7
66

AB
Y6
Management System QP CODE: 10054735

X5

X5
1A
5Y

1
5
B7

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

66

6
2

52

Y6
5
1A

1A
Y
X

X
25

25
B7

7
66

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

B
5

X5
1A

1A
5Y

5Y

Y
X
(2) Attempt any three questions out of the remaining five.

25
7

7
66

6
52

2
B

AB
Y6
(3) All questions carry equal marks.

X5

X5
1A
5Y
7X

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

5
7

7
66

66
52

52
AB

AB
A
Y

Y
X

X
61

61

1
5

5
7

6
52

2
B

B
Y6

6
1 Attempt any FOUR [20]

5
A

1A

A
Y

5Y
X

7X
61

61
25

5
7

6
2
a Compare File Processing System with Database Management system

2
05

AB
Y6

Y6

Y6
X5

X5

X5
1A

1
5

25
B7

7
b 05

B7
T1 T2

66
2

52
B
6
X5

X5
1A

1A
read(A)

5Y
7X
1
5
7

A := A − 50

7
66

66

6
2

52
B

AB

B
6
5
1A

1A
5Y

5Y

5Y
7X
read(A)

7X

7X
1
6

66
temp := A ∗ 0.1
52

52

2
AB

AB
6

X5
1A
5Y

5Y

5Y
A := A − temp
7X

7X
1

61
B7
6

66
2

52

52
AB

AB

write(A)
6

Y6
5

1A
5Y

Y
7X

X
read(B)
61

61

25

25
B7

7
66
52
B

B
Y6

write(A)
6

X5
A

1A

1A
Y

5Y
7X

X
61

read(B)
25

25

B7
66

6
2
B

B
6

Y6
X5

X5

B := B + 50

X5
A

1A

1A
5Y

5Y
61

write(B)

25
B7

B7

7
66

66
52

52

B
6

X5
commit
1A

1A

A
Y

5Y
X

61
25

5
B7

B7
B := B + temp
66

52

52
B
6

Y6
5
1A

write(B)
1A
5Y

5Y
X

7X
61

5
B7

commit
6

66
52

52

2
B

AB
6

Y6

X5
1A

1A
Y

5Y
7X

7X

Draw the precedence graph for above schedule? 61


5

B7
6

6
52

52
AB

B
6

Y6

Y6
5

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


A

1A
Y
7X

7X

7X
61

61
5

25
66
2

2
B

AB

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


Y6
X5

X5
A

1A

5Y
7X
61

61
25
7

B7

e Explain five aggregate functions of SQL with example? 05


6

52
B

B
Y6

Y6
5
A

1A

1A
Y
7X

7X
1
5

25

25
6

66
2

AB
6

6
X5

X5
1A
5Y

5Y

5Y
7X

2 a Design an EER diagram for Hospital Management System. And map it into [10]
61
B7

B7
6
2

52

52
B
6

6
5

relational model. Assume Suitable data.


A

1A
5Y

Y
7X

7X

7X
1

25
66

66
52
AB

AB

b Brief overall database architecture with suitable diagram. [10]


X5
A
5Y

5Y
X
61

61

61
7

B7
52

52
B
Y6

Y6

Y6
A

1A
X

7X

3 a Consider the following employee database. [10]


61
25

25

25
B7

66

B
6

X5
1A

A
5Y

Employee (empname, street, city, date_of_joining)


5Y
X

61
B7

B7
6
52

52
6

Y6

Works (empname, company_name,salary)


1A

1A
Y
7X

7X
5

25
66

66
52

Company (company_name, city)


AB

AB

X5
Y

5Y
7X
61

61
5

Manages (empname, manager_name)


B7
2

52
B

6
5
1A

1A
Y
7X

7X

Write the SQL queries for each of the statements given below
25
66

66
AB

AB
5
5Y

Y
X
61

61
25
B7
2

54735 Page 1 of 2
Y6

Y6
X5

X5
1A
25

25
B7

B7
66
X5

X5
1A
5Y
B7

B7

X525Y661AB7X525Y661AB7X525Y661AB7X525Y661AB7
66
52
AB
Y6
X5

5
A

7X
Paper / Subject Code: 38973 / Database Management System

61

61
25
B7

AB
Y6

Y6
X5
1A

7X
61
25

25
B7
66

AB
Y6
X5

X5
1A
5Y

1
5
B7

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

66

6
2

52

Y6
5
1A

1A
Y
X

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

25

25
B7

7
66

66

B
5

X5
1A

1A
5Y

5Y

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

25
7

7
66

6
52

2
B

AB
Y6
X5

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

1A
5Y
7X

1
5
7

7
66

66
52

52
AB

AB
as the companies for which they work

A
Y

Y
X

X
61

61

1
5

5
7

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

6
52

2
B

B
Y6

6
5
A

1A

A
Y

5Y
X

7X
61

61
employees of their company
25

5
7

6
2

2
B

AB
Y6

Y6

Y6
X5

X5

X5
1A
b Explain following relational algebra operators with example [10]

1
5

25
B7

B7
6

66
2

52
B
a) Selection operator b) Union operator

6
X5

X5
1A

1A
Y

5Y
7X
c) Rename operator d) Cartesian product

1
5
7

7
66

66

6
2

52
B

AB

B
6
5
1A

1A
5Y

5Y

5Y
7X

7X

7X
1
6

66
52

52

2
AB

AB
6

6
4 a Explain concurrency control and explain time Stamp based protocol of concurrency [10]

X5
1A
5Y

5Y

5Y
7X

7X
1

61
B7
control.
6

66
2

52

52
AB

AB
6

Y6
5

1A
5Y

Y
7X

X
b Why there is need of normalization? Explain 1NF,2NF,3NF and BCNF with [10]
61

61

25

25
B7

7
66
52
B

B
Y6

X5
A

1A

1A
Y

5Y
7X

examples.
X
61
25

25

B7
66

6
2
B

B
6

Y6
X5

X5

X5
A

1A

1A
5Y

5Y
61

25
B7

B7

7
66

66
52

52

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

X5
1A

1A

A
Y

5Y
X

61
25

5
B7

B7
transaction.
66

52

52
B
6

Y6
5
1A

1A
5Y

5Y
X

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

5
B7

7
6

66
52

52

2
B

AB
6

Y6

X5
1A

1A
Y

5Y
7X

7X

example. 61
5

B7
6

6
52

52
AB

B
6

Y6

Y6
5
A

1A
Y
7X

7X

7X
61

61
5

25
66
2

2
B

AB

6 Attempt any two


Y6
X5

X5
A

1A

5Y
7X
61

61
25
7

B7

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


6

52
B

B
Y6

Y6
5
A

1A

1A
Y
7X

7X

b Explain following Integrity constraints: [10]


1
5

25

25
6

66
2

AB
6

a) Key Constraints.
X5

X5
1A
5Y

5Y

5Y
7X

61

b) Domain Constraints (Null & Default Constraints).


B7

B7
6
2

52

52
B
6

6
5

c) Referential Constraints.
A

1A
5Y

Y
7X

7X

7X
1

25

d) Check Constraints.
66

66
52
AB

AB
X5

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


A
5Y

5Y
X
61

61

61
7

B7
52

52
B

______________________
Y6

Y6

Y6
A

1A
X

7X
61
25

25

25
B7

66

B
6

X5
1A

A
5Y

5Y
X

61
B7

B7
6
52

52
6

Y6
1A

1A
Y
7X

7X
5

25
66

66
52
AB

AB

X5
Y

5Y
7X
61

61
5

B7
2

52
B

6
5
1A

1A
Y
7X

7X
25
66

66
AB

AB
5
5Y

Y
X
61

61
25
B7
2

54735 Page 2 of 2
Y6

Y6
X5

X5
1A
25

25
B7

B7
66
X5

X5
1A
5Y
B7

B7

X525Y661AB7X525Y661AB7X525Y661AB7X525Y661AB7
66
52

You might also like