Final - I DBMS - 2014 - B.TECH

[For Use by Moderator only]
Accepted Rejected Name : …………………………..…….. Signature : ………………..
III-SEMESTER END TERM EXAMINATION:NOV-DEC,2014
PROGRAMME NAME ------------B.Tech (CSE) ---------------------------------------
COURSE CODE …… CSE 201 COURSE TITLE _DATA BASE MANAGEMENT SYSTEMS
Regular Repeaters Both
Time: --3 Hrs Max Marks: 70
Note: Attempt questions from all sections as directed.
Section - A : Attempt any five questions out of six. Each question carries 06 marks. [30 Marks]
1. How database approach is better than file system approach explain with the help of suitable example.
2. Differentiate between specialization hierarchy and specialization lattice with the help of suitable example.
3. Give the algorithm to find the non-redundant cover. Also find the minimal cover of following set of FDs
F= {A→ BC, CD→ E, E→ C, D→ AEH, ABH→ BD, DH→ BC}
4. Since every conflict-serializable schedule is view serializable, why do we emphasize conflict
serializability rather than view serializability?
5. “ If a relation is broken into BCNF, it will be lossless and dependency preserving”. Prove or disprove this
statement with the help of an example. Compare BCNF with fourth normal form.
6. What is a query evaluation plan ? Explain with the help of an example.
SECTION- B (Attempt any two of the following)
7. A) How we test Conflict Serializability? Draw the precedence graph for schedule S1 and S2 and state
whether each schedule is serializable or not. Write the equivalent serial schedule.
T1: r1(X); r1(Z); w1(X);
T2: r2(Z); r2(Y); w2(Z); w2(Y);
T3: r3(X); r3(Y); w3(Y);
S1: r1(X); r2(Z); r1(Z); r3(X); r3(Y); w1(X); w3(Y); r2(Y); w2(Z); w2(Y);
S2: r1(X); r2(Z); r3(X); r1(Z); r2(Y); r3(Y); w1(X); w2(Z); w3(Y); w2(Y);
B) Discuss multiversion technique, for what purpose is it used? Compare multiversion two phase locking
with basic two phase locking.

8. BOOK (ISBN, Book_title, Category, Price, Copyright_date,year,page_count, P_ID)
PUBLISHER(P_ID,Pname, Address, state, Phone, Email_id)
AUTHOR( A_ID, Aname, City, State, Zip, Phone, URL)
AUTHOR_BOOK(A_ID, ISBN)
REVIEW(R_ID, ISBN, Rating)
Based on above relation schema perform the following queries using relational algebra and tuple
relational calculus.
a. Retrieve ID, name, URL of author and category of book C++.
b. Retrieve the name of publishers who have published all categories of book
c. Retrieve name and address of publishers who have not published any books.
d. Retrieve book title, price, author name and URL for the publisher ‘Bright Publication’.
9. Discuss the various steps involved in query processing with the help of a block diagram. What is the goal
of query optimization? Why it is important? Also explain how does heuristics help in reducing cost of
execution of a query?
Section- C (Compulsory 20 marks)
A university registrar’s office maintains data about the following entities: (a) courses, including number,
title, credits, syllabus, and prerequisites; (b) course offerings, including course number, year, semester,
section number, instructor(s), timings, and classroom; (c) students, including student-id, name, and
program; and (d) instructors, including identification number, name, department, and title. Further, the
enrollment of students in courses and grades awarded to students in each course they are enrolled for must
be appropriately modeled. Construct an E-R diagram for the registrar’s office.Document all assumptions
that you make about the mapping constraints.
a. Draw ER diagram , show cardinality and participation clearly. ( Mention the assumptions made by you.)
b. Construct a relational model schema by clearly mentioning Primary Key and Foreign Key relations in the
table.
*******
……………………………………
Signature of Paper Setter
Name of Paper Setter……………………………

Employee Code…………………………………
Note: The paper should be typed in double space and should be deleted from the computer
immediately after taking the print.

Final - I DBMS - 2014 - B.TECH

Uploaded by

Copyright:

Available Formats

Final - I DBMS - 2014 - B.TECH

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Final - I DBMS - 2014 - B.TECH

Uploaded by

Copyright:

Available Formats

[For Use by Moderator only]

Accepted Rejected Name : …………………………..…….. Signature : ………………..

III-SEMESTER END TERM EXAMINATION:NOV-DEC,2014

PROGRAMME NAME ------------B.Tech (CSE) ---------------------------------------

Note: Attempt questions from all sections as directed.

F= {A→ BC, CD→ E, E→ C, D→ AEH, ABH→ BD, DH→ BC}

4. Since every conflict-serializable schedule is view serializable, why do we emphasize conflict

serializability rather than view serializability?

6. What is a query evaluation plan ? Explain with the help of an example.

SECTION- B (Attempt any two of the following)

T1: r1(X); r1(Z); w1(X);

T2: r2(Z); r2(Y); w2(Z); w2(Y);

T3: r3(X); r3(Y); w3(Y);

with basic two phase locking.

a. Retrieve ID, name, URL of author and category of book C++.

Section- C (Compulsory 20 marks)

that you make about the mapping constraints.

Name of Paper Setter……………………………

You might also like