Scribd
Upload
160 views2 pages

RDBM2 (6th) May2018 PDF

This document is a two page exam paper for a Relational Database Management Systems course. It contains instructions for students on the structure and requirements of the exam. The exam consists of three sections - Section A contains 10 short answer questions worth 2 marks each, Section B contains 5 longer answer questions worth 5 marks each where students must attempt 4, and Section C contains 3 even longer answer questions worth 10 marks each where students must attempt 2. The document provides examples of the types of questions that may be asked, such as distinguishing between DDL and DML, discussing transaction states, comparing database features of Oracle, SQL Server and MySQL, and explaining the query processing steps.

Uploaded by

Atul Dhar dubey
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
160 views2 pages

RDBM2 (6th) May2018 PDF

This document is a two page exam paper for a Relational Database Management Systems course. It contains instructions for students on the structure and requirements of the exam. The exam consists of three sections - Section A contains 10 short answer questions worth 2 marks each, Section B contains 5 longer answer questions worth 5 marks each where students must attempt 4, and Section C contains 3 even longer answer questions worth 10 marks each where students must attempt 2. The document provides examples of the types of questions that may be asked, such as distinguishing between DDL and DML, discussing transaction states, comparing database features of Oracle, SQL Server and MySQL, and explaining the query processing steps.

Uploaded by

Atul Dhar dubey
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. – 6)


RELATIONAL DATABASE MANAGEMENT SYSTEM-II
M Code: 71108
Subject Code: BTCS-602
Paper ID: [A2307]
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.

SECTION A

o m
1. Write briefly:
.r c m
a) Distinguish between DDL and DML.

p e o
.r c
b) State any two variations of 2PL protocol.
c)
a
What are the advantages and disadvantages of DDBMS?

p
d)
e)
b r
How the checkpoints are used for recovery? Discuss.
What are multiple granularities locking?
p e
f) What is Shadow paging?
a
g)
h)
What is Buffer Management?

brp
What is database Schema, which query sub language used to create schema?
i) Discuss BCNF normal form.
j) What is OLAP? Discuss its types.

M-71108 Page 1 of 2
SECTION B
2. Discuss three-tier architecture of the database and use of mapping between schema levels.
3. Discuss the advantages and disadvantages of OODBMS.
4. What is a transaction? What are various states of a transaction? Explain each state with the
help of an example.
5. Define fragmentation and explain various types of fragmentation with suitable examples.
6. Compare the different features of Oracle, Microsoft SQL server and MySQL.

SECTION C
7. a) Differentiate between Strict two-phase locking protocol and conservative two-phase
locking protocol for concurrency control in databases with the help of an example.
b) Why 4NF is a normal form more desirable than BCNF?

o m
8. Define Data Mining. Describe the process of data mining. Discuss the relationship between

.r c
data warehousing and data mining.
9. What are the steps involved in query processing? Explain. How would you estimate the cost

m
of the query?

p e o
p a .r c
b r p e
a
b rp

M-71108 Page 2 of 2

You might also like