0% found this document useful (0 votes)
24 views3 pages

Dbms Dec Jan

The document outlines the examination structure for the Database Management System course for the Fourth Semester B.E./B.Tech. Degree Examination, including details on modules, questions, and marks distribution. It specifies that students must answer five full questions, selecting one from each module, covering topics such as database concepts, relational algebra, normalization, transactions, and concurrency control. The document also includes specific questions and tasks related to these topics for assessment.

Uploaded by

nimeca9161
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)
24 views3 pages

Dbms Dec Jan

The document outlines the examination structure for the Database Management System course for the Fourth Semester B.E./B.Tech. Degree Examination, including details on modules, questions, and marks distribution. It specifies that students must answer five full questions, selecting one from each module, covering topics such as database concepts, relational algebra, normalization, transactions, and concurrency control. The document also includes specific questions and tasks related to these topics for assessment.

Uploaded by

nimeca9161
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

.

--
,,,..-.. " ' r-----,----r--.-----,--.---.--,----,--,----.
//::~Bl~l·
•. "",.t
BCS403

Fourth Semester B.E.lB.Tech. Degree Examination, Dec.2024/Jan.2025


Database Management System
,I

Time.Lhrs. Max. Marks: 100


Note: 1. Answer any FIVE full questions, choosing ONE full question from each module.
2. M : Marks , L: Bloom 's level. C: Course outcomes.

Module -1 M L C
Q.1 a. Define the fo Hawing terms: 05 Ll COl
(i) Database (ii) Schema (iii) Ent ity
(iv) DDL (v) Degree of a relationship
b. Briefly explain characteristics of database approach. 05 L2 COl
c. List and explain advantages of using DBMS approach. 10 L2 COl

.
OR
Q.2 a. Define the following term.'): 05 Ll COl
( i) Cardinality (ii) Weak entity (iii) Program data independence
(iv) DML (v) Value sets
b. Describe three-schema architecture. Why do we need mappings between ..05 L2 COl
schema levels?
c. Explain different types of attributes in ER model with suitable example tor 10 L2 COl
each.

Module - 2
Q.3 a. With suitable example, explain the entity integrity and referential integrity 05 L2 CO2
constraints. Why eaeh is considered important?
b. Discuss equijoin and natural join with suitable example using relational 05 L2 CO2
algebra notation.
c. Given the relational tables: 10 L3 CO2
Employee: Department:
EID Name DepID Salary DeptID DeptName
1 Alice 10 5000 10 HR
2 Bob 20 6000 20 IT
3 Eve 20 6500 30 Sales
Project
,
PID Project Name DeptlD
101 Project Alpha 10
102 Project Beta 20
103 Project Ganuna 30
Write relational algebra expression for the following:
-
( i) Find the names and salaries of all employees in the 'IT' department.
(ii) Find the ID's and names of employees who are in the 'IT' department
and have a salary greater than 6000.
(iii) Find the ID's and names of employees who are either in the 'HR'
. -
department or have a salary greater than 6000.
(iv) Find the names of employees who are not in the 'IT' department
(v) Find the names of employees along with their department names.

1 of3
BCS403
.
OR
Q.4 a. Exp lain any two operations that change the state of relat ion in a database. 05 'L2 CO2
Provide suitable examples.
b. Discuss the aggregation functions and grouping in relational algebra with 05 L2 CO2
suitable examples.
c. Given the relational tables: 10 L3 CO2
Student: Project:
SID Name PID Project Name
a Alice p Alpha

J
b Bob q Beta
c Carol r Gamma
_._---
Language: Enrollment:
_.
LlD Language Name SrD PID
x Python a p
y Java a q
z C++ b q
c r
Write relational algebra expression for the following:
(i) Rename the student table to Learner and display it.
( ii) Find the students (learners) who are not enrolled in any project.
(iii) Find the students who are enrolled in all projects.
(iv) Find the students who are not enrolled in any project.
(v) Find the students who are enrolled in both the "Alpha' and 'Beta'
projects.

Module - 3
Q.S a. Explain Armstrong inference rules. 05 L2 C04
b. What is the need for normalization? Explain INF, 2NF and 3NF with 05 L2 C04
examples.
c. What is functional dependency? Write an algorithm to find minimal cover 10 L3 C04
for set of functional dependencies. Construct minimal cover M for set of
functional dependencies which arc: E = {B -+ A, D -+ A, AB -+ D}
- .. I
- OR
Q.6 a. Explain the types of update anomalies in SQL with an example. 05 L2 C04
b. Explain types of JBBC drivers. ;05 L2 COS
c. Consider the schema R = ABCD, subjected to FDs F = {A -+8. B -+C}, 10 L3 C04
and the non-binary partition D 1 = {ACD, AB, BC}. State whether D I is a
losslcss decomposition? [give all steps in detail].

Module - 4
Q.7 a. Define transaction. Discuss ACID properties. 05 L2 COS
b. With a neat diagram, explain transition diagram of a transaction. 05 L2 COS
c. Demonstrate working of assertion and triggers in SQL with example. 10 L3 COS
OR
Q.8 a. Explain cursor and its properties in embedded SQL with suitable example. 05 L2 COS
b. Determine if the following schedule 1S seria lizable and explain your 05 L2 COS
reasomng:
i) T 1 : R(X) W(X) 12: R(X)W(X) 11 : COMMIT 12: COMMIT
ii) 11 : W(X)R(Y) 12 : R(X)W(Y) T 1 : COMMIT T2: COMMIT

20f3
BCS403
,
c. Consider the tables below: 10 L3 C05
e- Sailors (sid : integer, sname : string, rating: integer, age: real)
Boats (bid: integer, bname : string, color : string);
Reserves (sid : integer, bid: integer, day: date)
Write SQL queries for the following:
(i) Write create table statement for reserves.
(ii) Find all information of sailors who have reserved boat number 101.
(iii) Find the names of sailors who have reserved at least one boat.
(iv) Find the names of sailors who have reserved a red boat.
Cv) Find the average age of sailors for each rating level.

.Module- 5
Q.9 a. Explain the CAP theorem. 05 L2 C06
b. What is NOSQL graph database? Explain Neo4j. 05 L2 C06
c. Why concurrency control and recovery are needed in DBMS? Demonstrate 10 L3 C05
with suitable examples types of problems that may occur when two simple
transactions run concurrently.

OR
Q.I0 a. Explain basic operations CRUD in MongoDB. 05 L2 C06
b. Explain deadlock prevention protocols. 05 L2 C05
.,.
c. Briefly discuss the two-phase looking techniques it) concurrency control. 10 L3 C05

*****

30f3

You might also like