Scribd
Upload
25 views

Relational Database Management Systems - I

This document is the question paper for a Relational Database Management Systems exam consisting of 3 sections with a total of 9 questions. Section A has 10 multiple choice questions worth 2 marks each. Section B has 5 questions worth 5 marks each and students must attempt 4. Section C has 3 questions worth 10 marks each and students must attempt 2. The questions cover topics such as database schema, weak entities, referential integrity, functional dependencies, deadlocks, locking, indexing, and data modeling.

Uploaded by

Sahil Sharma 734
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
25 views

Relational Database Management Systems - I

This document is the question paper for a Relational Database Management Systems exam consisting of 3 sections with a total of 9 questions. Section A has 10 multiple choice questions worth 2 marks each. Section B has 5 questions worth 5 marks each and students must attempt 4. Section C has 3 questions worth 10 marks each and students must attempt 2. The questions cover topics such as database schema, weak entities, referential integrity, functional dependencies, deadlocks, locking, indexing, and data modeling.

Uploaded by

Sahil Sharma 734
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/ 2

Roll No. Total No.

of Pages: 02
Total No. of Questions: 09

B.Tech.(CSE) (2011 Onwards) (Sem. – 5)


RELATIONAL DATABASE MANAGEMENT SYSTEMS–I
M Code: 70535
Subject Code: BTCS-502
Paper ID: [A2098]
Time: 3 Hrs. Max. Marks: 60

INSTRUCTIONS TO CANDIDATES:
1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
2. SECTION-B contains FIVE questions carrying FIVE marks each and students have to
attempt any FOUR questions.
3. SECTION-C contains THREE questions carrying TEN marks each and students have
to attempt any TWO questions.

o m
.r c
SECTION A

1. a) Define Database Schema and database state.

p e
b) What are weak Entities? How are they represented in database?
o m
a
c) Define Referential Integrity constraints.

p
d) Define Full Functional Dependency. .r c
b r
e) What is Deadlock during concurrent processing?

p e
f) Explain Variable Length Record.
a
rp
g) What predicate is used in Natural Join?
h) Explain Exclusive Lock. Why we use it?
i) What is dense index?
j) List different DAC privilege.
b

M-70535 Page 1 of 2
SECTION B

2. Discuss three-tier architecture of the database and use of mapping between schema levels.
3. What is the difference between procedural and nonprocedural DML’s?
4. Discuss different integrity constraints with example.
5. Implement following relation using SQL query where roll no is in 5 digits and each subject
of 70 marks.
Student (rollno, name, sub1, sub2, sub3, totalmarks, percentage)
Create the table, add 5 records and display name, roll no and percentage as data
6. Discuss lost update problem with an example.

SECTION C

o m
7. What is normalization? Explain first, second, third and BCNF Normal forms with suitable
example.
8. Consider the following relational database: .r c m
employee(employee-name, street, city)

p e o
a
works(employee-name, company-name, salary)
company(company-name, city)
p .r c
b r
manages(employee-name, manager-name)

p e
a
Give an expression in SQL for each of the following queries:

rp
a) Find the names, street address and cities of residence for all employees who work for
‘First Bank Corporation’ and earn more than Rs. 10,000.

companies for which they work. b


b) Find the names of all employees in the database who live in the same cities as the

c) Find the names of all employees in the database who live in the same cities and on the
same streets as do their managers.
9. Define data model. Explain record based data models using diagrams.

M-70535 Page 2 of 2

You might also like