Roll No.
(Printed Pages: 4)
AC-2393
B.E. III Semester (New Course) Main &&
Re-Examination, Dec. -2022
(Held in February-2023)
Database Management System (DBMS)
cSE
Maximum Marks :60
Time: Three Hours]
[Minimum Marks: 24
Note Attempt all questions from Section-'A, Four questions from
Section-'B' and Three questions from Section-'C'
Section A 1x10 10
1. Manipulating and processing of the database is called DDL (True/False)
2.
2 Number of tuples in relational database is called cardinality (True/False)
B. Attribute which belongs to same candidate key of Relational Schema in
Non Prime Attribute. (True/False)
A. Isolation property is implemented by concurrency control algorithm (True/
False)
5 In the Second Normal Form is based on the concept of full functional de-
pendency (True/False).
6. The entity relationship set is represented in E-R diagram as
(a) Double diamonds (b) Undivided rectangles
(c) Dashed lines (d) Diamond
7. A non prime attribute is calied
(a) That present in foreign key (b) That present in candidate key
(c) That present in primary key (d) None of these
P.T.O.
SET concept is used in
(a) Network model (b) Hierarchical model
oriented model None of these
(c) Object (d)
(9 Consider a schema R(A, B, C, D) and functional dependencies A-> B and
C->D. Then the decomposition of R into R1 (A, B) and R2 (C, D) is
(a) Dependency preserving and loss less join.
(b) Loss less join but not
dependency preserving.
(c) Dependency preserving but not loss less join..
(d) Not dependency preserving and not loss less join.
10. Foreign key is the one in which the of one relation is referenced in
another relation.
(a) Foreign key
(b) Primary key
(c) References
(d) Check constraint
Section - B
5x4-20
1. (a) What do you mean by DBMS? Also mention its application.
(b) What do you mean by key? Explain different type of key.
2. (a) Explain about Database model in brief.
(b) What is Dependency Preserving Decomposition? Explain with the
help of example.
Explain Basic operators of Relational Algebra with the help of Example.
4. Consider a relation scheme R=(A, B, C, D, E, H) on which the following
functional dependencies hold: {A->B, BC->D, E->C, D->A}.
(a) What are the candidate keys of R?
What are possiblesuper key in this relation and relation is in which
normal form?
AC-2393
(2)
5. What is recovery and atomicity
of transaction? Explain the log based re
covery.
Describe view serializability and determine the following schedule is vie
equivalent or not
T1 T2 T3
R(A)
W(A)
W(A)
WA)
Section - C 10x3=30
(a) What is conflict serializability explain with suitable example.
(b) What is the equivalent serial schedule for the following transactions?
T1 T2 T3
R(Y)
R(Z)
R(X)
Wx)
W(Y)
W(Z)
W(Z)
R(Y)
W(Y)
R(Y)
W(Y)
R(X)
W(X)
AC-2393 (3) P.T.O.
behind normalizing a
Normal form? What is the motivation
,2 (a) What are
database?
R(A BCDE)
{ABD -> C, BC -> D, CD -> E}
What is the highest Normal form of Relation? Explain.
. Partial Functional with the help of
(a) (i) What is Dependency? Explain
example
Find Extraneous Attributes in the given relation.
R{ABCD->E, BC ->F, F->D}
(b) Write short notes on:
(1) Prime Attributes
(2) Trival Functional Dependency
(3) Tupie
(4) Arity
(5) Cardinality
What is Concurrency? What are the three problem due to concurrency?
How the problem can be avoided?
Construct An ER-diagram for a car insurance company whose customers
owns one or more cars each. Each car has associated with its zero to any
number of recorded accidents.
AC-2393
(4)
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
