Scribd
Upload
14 views3 pages

Dbms

jnjk

Uploaded by

whocaress990
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
14 views3 pages

Dbms

jnjk

Uploaded by

whocaress990
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/ 3

106502IT

Roll No………………………..

Course Code: 106502IT


Examination: APRIL-MAY 2023
Course: DATABASE MANAGEMENT SYSTEM

Time Allowed: 3 Hours Maximum Marks: 100


Minimum Marks: 35
Note: Attempt all questions. Part (A) of each question is
compulsory and carries 4 marks; attempt any two parts from part
(B), (C) and (D) carrying 8 marks each.
Q1 A Define schema and instance with example. 4
B What are weak entity sets? How can they be 8
converted into strong entity?
C Draw a detailed ER diagram of University 8
Database contains information about professors
and courses, assumes necessary constraints.
D Differentiate between B and B+ tree with example. 8
Q2 A Differentiate between Relational Algebra and 4
Relational calculus.
B What are constraints? Explain constraints that are 8
used in SQL with syntax.
C Write short notes with example on: 8
i. Cursor
ii. Trigger
iii. Index
iv. DML

Page 1 of 3
106502IT

D What are views? List the two reasons why we may 8


choose to define a view. Explain your answer with
example.
Q3 A Compare 3NF and BCNF with suitable example. 4
B Explain full functional dependency and partial 8
dependency with example.
C What is normalization? What are the problems 8
without normalization? Explain the different kinds
of anomalies.
D Compute the closure of relational schema 8
R(ABCDE). The set of FD’s are:
i. A  BC
ii. CD  E
iii. B  D
iv. E  A
Find the key attribute of R. Also find all candidate
keys.
Q4 A What do you mean by serializability? Explain with 4
example.
B With a neat diagram explain the various steps 8
involved in query processing?
C Schedule 1. 8
T1 T2 T3
R(X)
W(X)
W(X)
W(X)

Page 2 of 3
106502IT

Draw the precedence graph for the above schedule


and prove, whether the given schedule is conflict
serializable or not?

D How serialisability of a schedule can ensure 8


consistency of database? Explain view
serialisability in detail with example.
Q5 A Explain the classification of failure with example. 4
B Compare deferred update and immediate update 8
technique for database recovery.
C Why concurrency control is required? Explain 8
Timestamp Ordering Protocol for concurrency
control.
D Write sort notes on: 8
i. Two phase locking protocol
ii. Checkpoint

Page 3 of 3

You might also like