JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech III DATABASE MANAGEMENT SYSTEMS Previous Question Paper (August/September - 2024 - R16)

B.Tech | III | I | R16 | August/September - 2024

Answer PaperPaper Code: 135CAMaximum Marks: 75Time: 3 Hours

Note: i) Question paper consists of Part A, Part B. ii) Part A is compulsory, which carries 25 marks. In Part A, Answer all questions. iii) In Part B, Answer any one question from each unit. Each question carries 10 marks and may have a, b as sub questions.

Part A

125 marks
a

Define schema.

2 marks

Answer

A schema is the logical structure or blueprint of a database that defines the organization of data, the relationships between data elements, and the constraints applied to the data. It describes how data is stored and accessed without specifying the actual data instances.

b

What is a data model?

3 marks

Answer

A data model is a collection of conceptual tools, notations, and rules used to describe the data, data relationships, data semantics, and consistency constraints of a database. It provides a way to represent the real-world environment in a structured format, serving as the foundation for database design.

c

What is an active database?

2 marks

Answer

Sign in to view the complete answer paper.

d

What is the need of outer join operation?

3 marks

Answer

Sign in to view the complete answer paper.

e

List the properties of decomposition.

2 marks

Answer

Sign in to view the complete answer paper.

f

What is meant by multi valued dependency?

3 marks

Answer

Sign in to view the complete answer paper.

g

Define transaction.

2 marks

Answer

Sign in to view the complete answer paper.

h

What is the benefit of early lock release?

3 marks

Answer

Sign in to view the complete answer paper.

i

What is a clustered index?

2 marks

Answer

Sign in to view the complete answer paper.

j

List the operations preferred on heap files.

3 marks

Answer

Sign in to view the complete answer paper.

Part B

2

Describe database architecture with a neat diagram.

10 marks

Answer

Sign in to view the complete answer paper.

OR
310 marks
a

Justify the use of weak entity sets in database design.

5 marks

Answer

Sign in to view the complete answer paper.

b

Demonstrate the steps in logical database design.

5 marks

Answer

Sign in to view the complete answer paper.

410 marks
a

Is Relational algebra a procedural DML? Justify your answer.

5 marks

Answer

Sign in to view the complete answer paper.

b

Contrast tuple relational calculus with domain relational calculus.

5 marks

Answer

Sign in to view the complete answer paper.

OR
5

Consider the following database schema to write queries in SQL:

Sailors(sid, sname, age, rating)

Boats(bid, bname, bcolor)

Reserves(sid, bid, day)

10 marks
a

Find the names of the sailors who have reserved a red boat.

2 marks

Answer

Sign in to view the complete answer paper.

b

Find the colours of the boats reserved by ‘Ramu’.

2 marks

Answer

Sign in to view the complete answer paper.

c

Find the sailors who have reserved atleast two boats.

3 marks

Answer

Sign in to view the complete answer paper.

d

Find the name of the youngest sailor.

3 marks

Answer

Sign in to view the complete answer paper.

6

Discuss the problems caused by redundancy and the significance of schema refinement.

10 marks

Answer

Sign in to view the complete answer paper.

OR
710 marks
a

Compare and contrast 2NF with 3NF.

5 marks

Answer

Sign in to view the complete answer paper.

b

With an example set of functional dependency explain attribute closure computation.

5 marks

Answer

Sign in to view the complete answer paper.

810 marks
a

Differentiate between serial schedule and serializable schedule.

4 marks

Answer

Sign in to view the complete answer paper.

b

With example schedule, explain two phase locking protocol for concurrency control.

6 marks

Answer

Sign in to view the complete answer paper.

OR
9

Discuss a recovery algorithm for handling recovery of system with concurrent transactions.

10 marks

Answer

Sign in to view the complete answer paper.

10

With relevant data records, demonstrate bulk loading of B+ tree index structure.

10 marks

Answer

Sign in to view the complete answer paper.

OR
1110 marks
a

Explain the concept of cylinder in disk organization.

6 marks

Answer

Sign in to view the complete answer paper.

b

Compare sparse index with dense index.

4 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the solved question paper with answers of DATABASE MANAGEMENT SYSTEMS from JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD for B.Tech CE(SE) III I, August/September - 2024, R16.

For the question paper without answers, switch to the Question Paper tab.

Other papers in DATABASE MANAGEMENT SYSTEMS

Loading Question Papers

Fetching data from database...