Be - Electronics and Computer Science - Semester 3 - 2024 - May - Database Management System Rev 2019 C Scheme
Be - Electronics and Computer Science - Semester 3 - 2024 - May - Database Management System Rev 2019 C Scheme
1
8
X1
A8
6Y
6X
2A
Paper / Subject Code: 51125 / Database Management Systems
46
22
12
84
Y2
A8
6Y
6X
2A
X
26
46
22
12
84
Y2
X1
A8
6Y
6X
2A
26
46
2
2
4
2
1
2
A8
1
8
Y
X
6Y
6X
Duration: 3hrs [Max Marks:80]
2A
26
6
22
2
84
2
1
A8
1
6Y
Y
X
6Y
6X
A
6
6
2
12
22
N.B. : (1) Question No 1 is Compulsory.
12
84
2
2
84
1
6Y
6X
Y
X
A
6X
2A
(2) Attempt any three questions out of the remaining five.
26
6
2
2
84
4
Y2
84
1
2
1
8
6X
(3) All questions carry equal marks.
6Y
2A
X
A
2A
6
6
2
2
84
2
Y2
4
(4) Assume suitable data, if required and state it clearly.
Y2
1
2
1
8
6X
6Y
2A
X
A
26
2A
26
6
2
84
2
2
84
X1
Y2
X1
2
1
Y
6Y
2A
6X
A
6
46
1 Attempt any FOUR [20]
26
46
2
2
2
84
X1
Y2
A8
X1
A8
1
Y
X
2A
6
6
26
22
46
22
6
2
4
a Justify the need of DBMS in Banking and Airlines.
4
1
Y2
A8
X1
6Y
8
6Y
8
X
6X
2A
6
26
2
6
12
2
2
4
2
84
Y2
84
1
2
8
X1
6Y
6X
6Y
A
b List all functional dependencies satisfied by the given relation.
2A
6
6
2
46
12
2
84
2
4
12
2
Y2
X1
Y2
8
6Y
8
6X
2A
A B C
6X
A
6
6
26
2
2
2
84
2
Y2
4
Y2
84
1
Y2
X1
8
X1
6X
A1 B1 C1
2A
2A
26
2A
26
6
6
46
84
2
2
4
X1
Y2
X1
Y2
X1
Y
A8
A1 B2 C1
A8
A
6
46
26
46
26
2
6
2
22
22
2
4
X1
A8
X1
A8
X1
Y
A2 B2 C1
A8
6Y
6Y
6
6
22
46
2
46
2
22
4
12
12
2
1
A8
6Y
A2 B2 C1
8
6Y
A8
X
6Y
X
A
6X
6
2
46
12
2
2
22
4
2
2
84
1
8
X1
6Y
8
6X
Y
X
6Y
2A
2A
c Describe UNION, INTERSECTION and DIFFERENCE operations in relational
6
6
6
12
2
4
2
4
2
2
4
Y2
A8
Y2
8
X1
6Y
A8
6X
6X
2A
algebra.
6
22
26
6
12
2
4
2
4
Y2
4
2
A8
X1
6Y
X1
A8
6X
Y
2A
26
26
22
6
12
46
2
4
2
A8
X1
6Y
A8
6X
A8
X
6Y
26
46
22
46
12
2
84
22
2
Y2
1
A8
1
6Y
A8
6X
2A
6Y
6X
26
6
2
12
22
84
Y2
12
2
4
1
8
6Y
8
6X
6Y
2A
6X
A
6X
26
2A
2 a Design a database for a worldwide package delivery company (e.g., DHL [10]
2
2
84
12
Y2
4
X1
84
1
Y2
8
Y
6X
2A
X
A
26
2A
46
2
Y2
4
X1
Y2
A8
Y2
X1
8
6X
2A
2A
26
46
ship items and customers who receive items; some customers may do
6
26
6
2
84
Y2
4
X1
2
A8
X1
X1
A8
Y
2A
26
26
22
46
46
2
2
1
2
A8
X1
6Y
A8
Y
A8
6X
6Y
must be able to store the location of the package and its history of
26
2
46
12
22
22
84
2
Y2
X1
A8
6X
6Y
6X
6Y
2A
46
22
2
84
12
Y2
X1
8
Y
X
2A
6
6
12
4
Y2
84
X1
Y2
A8
A8
2A
26
46
6
22
46
22
2
X1
Y2
A8
X1
6Y
8
6Y
constraints.
2A
46
26
22
6
12
4
Y2
A8
X1
6Y
A8
6X
26
22
46
12
2
84
2
1
6Y
A8
6X
Y
6X
2A
22
84
84
Y2
X1
6X
6Y
2A
2A
26
46
84
12
Y2
X1
8
2A
6X
A
26
46
2
Y2
84
2
X1
A8
6Y
2A
26
55132 Page 1 of 2
46
22
12
X1
Y2
A8
6Y
6X
46
26
22
12
X1
A8
6Y
6X
X126Y22A846X126Y22A846X126Y22A846X126Y22A846
46
22
12
84
2
1
8
X1
A8
6Y
6X
2A
Paper / Subject Code: 51125 / Database Management Systems
46
22
12
84
Y2
A8
6Y
6X
2A
X
26
46
22
12
84
Y2
X1
A8
6Y
6X
2A
26
46
2
2
4
2
1
2
A8
1
8
Y
X
6Y
6X
2A
26
3 a Consider the following schema. The primary keys are underlined.
6
22
2
84
2
1
A8
1
6Y
Y
X
6Y
6X
A
6
6
2
12
22
12
84
2
2
84
Student (Snum, Name, Major, Level, Age)
1
6Y
6X
Y
X
A
6X
2A
26
6
2
Class (Name, Time, Room, Fid)
2
84
4
Y2
84
1
2
1
8
6X
6Y
2A
X
A
Enrolled (Snum, ClassName)
2A
6
6
2
2
84
2
Y2
4
Y2
1
2
1
8
Faculty (Fid, Name, Dept)
6X
6Y
2A
X
A
26
2A
26
6
2
84
2
2
84
X1
Y2
X1
2
1
Y
6Y
2A
6X
A
6
46
26
Write SQL queries for the following
46
2
2
2
84
X1
Y2
A8
X1
A8
1
Y
a. Find the names of all CS Majors (Major = "CS") who are enrolled in the course
X
2A
6
6
26
22
46
22
6
2
4
4
1
Y2
A8
"Math20" and are older than some History freshman (Level="FR").
X1
6Y
8
6Y
8
X
6X
2A
6
26
2
6
12
2
2
b. Find the names of all pairs of students who are enrolled in some class together.
4
2
84
Y2
84
1
2
8
X1
6Y
6X
6Y
A
2A
c. Find the names of faculty members who teach in every room in which some
6
6
2
46
12
2
84
2
4
12
2
Y2
X1
Y2
8
6Y
8
6X
2A
6X
A
6
6
26
2
2
2
84
2
Y2
4
Y2
d. Print the Level and the average age of students for that Level, for each Level.
84
1
Y2
X1
8
X1
6X
2A
2A
26
2A
26
6
6
e. Find the names of all students who are not enrolled in any class taught by
46
84
2
2
4
X1
Y2
X1
Y2
X1
Y
A8
A8
A
"Srinivasan".
6
46
26
46
26
2
6
2
22
22
2
4
X1
A8
X1
A8
X1
Y
A8
6Y
6Y
6
6
22
46
2
22
4
12
12
2
1
A8
6Y
8
6Y
A8
X
6Y
X
A
6X
6
2
46
12
2
2
22
4
2
2
84
1
8
X1
6Y
8
6X
Y
X
6Y
2A
2A
6
6
6
12
2
4
2
4
2
2
4
b Explain types of integrity constraints with example.
Y2
[10]
A8
Y2
8
X1
6Y
A8
6X
6X
2A
6
22
26
6
12
2
4
2
4
Y2
4
2
A8
X1
6Y
5 a What are three data anomalies? Explain how it can be overcome by using
X1
[10]
A8
6X
Y
2A
26
26
22
6
12
46
2
4
normalization.
4
Y2
1
2
A8
X1
6Y
A8
6X
A8
X
6Y
26
46
22
46
12
2
84
22
2
Y2
1
b Consider data item A and B. Find whether the following schedule is conflict [10]
A8
1
6Y
A8
6X
2A
6Y
6X
26
6
2
12
22
84
Y2
serializable or not.
4
12
2
4
1
8
6Y
8
6X
6Y
2A
6X
A
6X
26
2A
Schedule U: r2(A),w2(A),r1(A),w1(A),r2(B),w2(B).
2
2
84
12
Y2
4
X1
84
1
Y2
8
Y
6X
2A
X
A
26
2A
46
6
6
2
2
84
6 a Explain properties of transactions in detail. Give appropriate example for each [10]
2
Y2
4
X1
Y2
A8
Y2
X1
8
6X
2A
2A
26
46
property.
6
26
6
2
84
Y2
4
X1
2
A8
X1
X1
A8
Y
2A
26
46
26
22
46
46
b Consider the following dependency diagram of relation R and Normalize till [10]
2
2
1
2
A8
X1
6Y
A8
Y
A8
6X
6Y
3NF
26
2
46
12
22
22
84
2
Y2
X1
A8
6X
6Y
6X
6Y
2A
26
46
22
2
84
12
Y2
X1
8
Y
X
2A
6X
2A
26
46
6
6
12
4
Y2
84
X1
Y2
A8
A8
2A
26
46
6
22
46
22
2
X1
Y2
A8
X1
6Y
8
6Y
2A
46
26
22
6
12
4
Y2
A8
X1
6Y
A8
6X
26
22
46
12
2
84
2
1
6Y
A8
6X
Y
6X
2A
26
12
22
84
84
Y2
X1
________________________
6X
6Y
2A
2A
26
46
84
12
Y2
X1
8
2A
6X
A
26
46
2
Y2
84
2
X1
A8
6Y
2A
26
55132 Page 2 of 2
46
22
12
X1
Y2
A8
6Y
6X
46
26
22
12
X1
A8
6Y
6X
X126Y22A846X126Y22A846X126Y22A846X126Y22A846
46
22
12
84