JNTU Database Management Systems question paper - May 2010 Regulation 2007 / JNTU Hyderabad-Kakinada Previous Year 2010 Exam Questions / JNTU Previous Year 2010 Computer Science and Engineering, Information Technology, and Computer Science and System Engineering Question Papers / Jawaharlal Nehru Technological University Database Management System Previous Year Question Papers
Code No: 07A4EC14 R07 Set No. 1
II B.Tech II Semester Regular/Supplementary
Examinations, May - 2010
DATABASE
MANAGEMENT SYSTEMS
Common to Information Technology, Computer
Science And Engineering
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
* * * * *
1. (a) What is redundancy?
(b) What are the different problems encountered by redundancy?
Explain them [4+12]
2. (a) Define DBMS? List Database system Applications.
(b) Explain Database Administrator's responsibilities. [8+8]
3. (a) What is a weak entity set? Differentiate between weak entity
set and strong entity set.
(b) Define Aggregation. What is the problem associated with
aggregation? Discuss the remedies. [8+8]
4. (a) Consider the following Schema:
Suppliers (sid : integer, sname: string, address: string)
Parts (pid : integer, pname: string, color: string)
Catalog (sid : integer; pid : integer, cost: real)
The key fields are underlined. The catalog relation lists the price
changes for parts by supplies. Write the following queries in SQL.
i. Find the pnames of parts for which there is some supplier.
ii. Find the snames of suppliers who supply every part.
iii. Find the pnames of parts supplied by raghu supplier and no one
else.
iv. Find the sids of suppliers who supply only red parts.
(b) Consider the following Schema:
Suppliers (sid : integer, sname: string, address: string)
Parts (pid : integer, pname: string, color: string)
Catalog (sid : integer; pid : integer, cost: real)
The key fields are underlined. The catalog relation lists the price
changes for parts by supplies. Write the following queries in SQL.
i. Find sids of suppliers who supply a red part and a green part.
ii. Find sids of suppliers who supply a red part or a green part.
iii. For every suppliers that only supplies green parts, print the
name of the supplier. [8+8]
5. Explain B+ Trees? [16]
6. Since every conflict-serializable schedule is view serializable,
why do we emphasize conflict serializability rather than view
serializability? [16]
7. Consider the following Schema:
Suppliers (sid : integer, sname: string, address: string)
Parts (pid : integer, pname: string, color: string)
Catalog (sid : integer; pid : integer, cost: real)
The key fields are underlined. The catalog relation lists the price
changes for parts by supplies. Write the following Queries in Tuple
relational calculus and Domain relational calculus.
(a) Find the sids of suppliees who supply every red part
(b) Find the sids of suppliees who supply every red part or supply
every green part.
(c) Find the names of suppliees who supply some red part.
(d) Find parts of sids such that the supplies with the first sid
changes more. [16]
8. Explain advanced recovery Techniques? [16]
______________
|
Code No: 07A4EC14 R07 Set No. 2
II B.Tech II Semester Regular/Supplementary
Examinations, May - 2010
DATABASE
MANAGEMENT SYSTEMS
Common to Information Technology, Computer
Science And Engineering
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
* * * * *
1. (a) What is Normalization? What are the various normal forms.
(b) Explain First NF with examples?
(c) Explain Second NF with examples? [4+6+6]
2. (a) Explain Clustered Indexes?
(b) Explain primary & Secondary Indexes? [8+8]
3. Explain the following in SQL with examples.
(a) Nested Queries
(b) Correlated Queries
(c) Group by and Having Clauses
(d) Triggers [16]
4. (a) How many types of recovery techniques with concurrent
transactions?
(b) Differentiate Transaction Rollback & Restart recovery? [8+8]
5. (a) Define the divisible operation in terms of the basic Relational
Algebra operations. Describe a typical
query that calls for division. Unlike join, the division operation is not
given special treatment in database systems. Explain why.
(b) Relational calculus is said to be a declarative language, in
contrast to algebra, which is a procedural language. Explain the distinction.
[8+8]
6. What is a cascade less schedule? Why is cascade less property of
schedules desirable? Are there any circumstances under which it would be
desirable to allow non cascade less schedules? Explain your answer? [16]
7. (a) List four significant differences between a File processing
system and a DBMS.
(b) Explain the difference between Logical and Physical data independence.[8+8]
8. (a) What is a partial key? How is it represented in ER diagram?
Give an example.
(b) What is a descriptive attribute? Explain.
(c) Discuss the usage of ISA feature in ER diagrams. [6+4+6]
_____________________
|
Code No: 07A4EC14 R07 Set No. 3
II B.Tech II Semester Regular/Supplementary
Examinations, May - 2010
DATABASE
MANAGEMENT SYSTEMS
Common to Information Technology, Computer
Science And Engineering
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
* * * * *
1. Explain Buffer Management in detail. [16]
2. Define functional dependencies. How are primary keys related to
Functional dependencies? [16]
3. Explain Different states of Transactions? [16]
4. (a) Explain the difference between logical and physical data
independence.
(b) Give short notes on Transaction management. [8+8]
5. (a) Define all the variations of the join operation. Why is the
join operation given special attention? Cannot we express every join
operation in terms of Cross-product, Selection and Projection?
(b) Relational Calculus is said to be a declarative language, in
contrast to algebra, which is a procedural language. Explain the distinction.
[8+8]
6. (a) Write a detail note on participation constraint.
(b) What is the class hierarchy? How is it represented in the ER
diagrams? [8+8]
7. Explain heap _le with un clustered Hash index? [16]
8. (a) Write the following queries in SQL using Nested queries concept
for following Schema.
Sailors (sid: integer, sname: string, rating: integer, age: real)
Boats (bid: integer, bname: string, color: string)
Reserves (sid: integer, bid: integer, day: date)
i. Find the names of sailors who have reserved both red and green boat
ii. Find the names of sailors who have reserved all boats
iii. Find the names of sailors who have not reserved red boat
iv. Find sailors whose rating is better than some sailor called raghu.
(b) What is a correlated nested query? Explain with an example. [12+4]
____________________
|
Code No: 07A4EC14 R07 Set No. 4
II B.Tech II Semester Regular/Supplementary
Examinations, May - 2010
DATABASE
MANAGEMENT SYSTEMS
Common to Information Technology, Computer
Science And Engineering
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
* * * * *
1. (a)
Construct an ER diagram for a bank Database. Bank maintains data about customers,
their loans, their deposits, lockers. Determine the entities and relationships.
(b) What is
the composite attribute? How to model it in the ER diagram? Explain with an
example. [8+8]
2. (a)
Explain Log-Record Buffering?
(b) Explain
Database Buffering? [8+8]
3. (a) What
is grouping? Is there a counterpart in Relational Algebra? Explain this
feature and discuss the interaction of the HAVING and WHERE clauses. Mention
any restrictions that must be satis_ed by the _elds that appears in the GROUP
BY Clause.
(b) What are
the differences between Integrity Constraints and Triggers? [10+6]
4. (a)
Explain about the following
i. Key
constraints
ii.
Specifying foreign key constraints in SQL with an example.
(b) What is
a view? Explain about views in detail. [8+8]
5. (a)
Explain Third NF with examples?
(b) Explain
BCNF with examples? [8+8]
6. (a)
Explain Heap file with un clustered Tree index?
(b) Explain
Heap file with un clustered Hash index? [8+8]
7. (a)
Explain validation protocol with example?
(b) Explain
granularity and multiple granularity? [8+8]
8. (a)
Describe storage manager component of database system structure.
(b) Explain
levels of abstraction in DBMS? [8+8]
___________________
|