Uttar Pradesh Board of Technical Education 2010 B.E Computer science information technology (CSIT) Dbms - exam paper

NOTE:-1. THERE ARE 5 ques. IN THE PAPER.ATTEMPT ALL ques..
2. ATTEMPT ALL ques. AT 1 PLACE
3. MAKE NECESSARY ASSUMPTION,IF needed



1. ATTEMPT ANY 4 PARTS

A. WHAT IS DATABASE MANAGEMENT SYSTEM?LIST ANY 3 MAJOR ADVANTAGES OF DATABASE MANAGEMENT SYSTEM OVER TRADITIONAL FILE PROCESSING SYSTEM.

B. WHAT IS DATA MANIPULATION LANGUAGE?WHAT ARE DIFFERENCES ranging from MANIPULATION LANGUAGE AND DATA DEFINITION LANGUAGE?

C. WHAT DO YOU MEAN BY DATA INDEPENDENCE?EXPLAIN THE DIFFERENCE ranging from PHYSICAL AND LOGICAL DATA INDEPENDENCE.

D. WHAT DO YOU MEAN BY A KEY TO THE RELATION?EXPLAIN THE DIFFERENCES ranging from SUPER KEY,CANDIDATE KEY AND PRIMARY.

E. elaborate E-R DIAGRAMS?EXPLAIN THE CONCEPT IN SPECIALIZATION AND GENERALIZATION ranging from ENTITY SETS.

F. CONSTRUCT AN E-R DIAGRAM FOR YOUR INSTITUTE WITH A SET OF TEACHERS AND SET OF learner.TEACHERS OFFER different SUBJECTS TO various CLASSES.

2. ATTEMPT ANY 2 PARTS:-

A. CONSIDER THE subsequent SCHEMA FOR INSTITUTE LIBRARY:

STUDENT(ROLLNO,NAME,FATHER-NAME,BRANCH)

BOOK(ISBN,TITLE,AUTHOR,PUBLISHER)

ISSUE(ROLLNO,ISBN,DATE-OF-ISSUE)

WRITE THE subsequent QUERIES IN RELATION ALGEBRA:

(i) LIST ROLL NUMBER AND NAME OF ALL STUDENTS OF THE BRANCH 'CSE'.

(ii) obtain THE NAME OF learner WHO HAVE ISSUED A BOOK PUBLISHED BY 'ABC' PUBLISHER.

(iii) LIST TITLE OF ALL BOOKS AND THEIR writers ISSUED BY A learner 'XYZ'

(iv) LIST TITLE OF ALL BOOKS ISSUED ON OR BEFORE JAN 1,2011.

(v) LIST ALL BOOKS PUBLISHED BY PUBLISHER 'ABC'.

B. ans subsequent QUESTIONS:

(i) WHAT DO YOU MEAN BY REFERENTIAL INTEGRITY?EXPLAIN THE CONCEPT OF FOREIGN KEY WITH A SUITABLE EXAMPLE.

(ii) elaborate DIFFERENCE IN CARTESIAN-PRODUCT AND NATURAL-JOIN OPERATIONS?EXPLAIN WITH A SUITABLE EXAMPLE.

C. CONSIDER THE subsequent SCHEMA FOR learner DATABASE OF AN INSTITUTE:

TEACHER(TEACHERID,TNAME,DEPARTMENT)

STUDENT(ROLLNO,SNAME,BRANCH)

TEACHERS(TEACHERSID,ROLLNOSUBJECT)

WRITE THE subsequent QUERIES IN SQL:

(i) WRITE SQL STATEMENT TO CREATE ABOVE DATABASE.

(ii) WRITE SQL STATEMENT TO INSERT 1 RECORD TO every TABLE.THE DATA CAN SUITABILY BE presumed.

(iii) LIST THE NAME AND BRANCH OF learner REGISTERED FOR SUBJECT 'DBMS'.

(iv) LIST THE BNAME OF TEACHERS AND THEIR CONCERNED DEPARTMENT WHO ARE OFFERING EITHER 'DBMS' OR 'OPERATING SYSTEM'.

(V) LIST THE NAME OF learner WHO ARE BEING TAUGHT BY TEACHERS OF 'CSE' DEPARTMENT.


3. ATTEMPT ANY 2 PARTS:-


(A) describe FUNCTIONAL DEPENDENCY?WHAT DO YOU MEAN BY LOSS-LESS DECOMPOSITION.EXPLAIN WITH A SUITABLE EXAMPLE HOW FUNCTION DEPENDENCIES CAN BE USED TO SHOWTHAT DECOMPOSITION ARE LOSS-LESS.

(B) WHAT DO YOU MEAN BY ELOSURE OF AN ATTRIBUTE SET? CONSIDER A RELATIONAL SCHEMA R=(ABCD) AND subsequent SET OF FUNCTIONAL DEPENDENSCIES:

F=(A->BC,AC->D,D->B,AB->D)

DETERMINE IF THE ATTRIBUTE SET {A},{BD},{D} AND {AC} ARE SUPER KEY FOR THIS RELATION.

(C) DEFINR NORMAL FORMS.LIST THE DEFINITION OF FIRST,SECOND AND 3rd FORMS.EXPLAIN BCNF WITH A SUITABLE EXAMPLE.


4. ATTEMPT ANY 2 PARTS:-

(A) WHAT IS TRANSACTION? DRAW A STATE DIAGRAM OF A TRANSACTION SHOWING ITS STATES.EXPLAIN ACID PROPERTIES OF A TRANSACTION WITH SUITABLE EXAMPLES.

(B) elaborate SCHEDULES? elaborate DIFFERENCES ranging from CONFLICT SERIALIZABILITY AND VIEW SERIALIZABILITY? discuss WITH SUITABLE EXAMPLE elaborate CACADELESS AND RECOVERABLE SCHEDULES.

(C) elaborate DISTRIBUTED?LIST ADVANTAGES AND DISADVANTAGES OF DATA REPLICATION AND DATA FRAGMENTATION.EXPLAIN WITH A SUITABLE,WHAT ARE DIFFERENCES IN REPLICATION AND FRAGMENTATION TRANSPARENCY.

5. ATTEMPT ANY 2 PARTS :-

(A) WHAT IS 2 PHASE LOOKING PROTOCOL?LIST THE SALIENT FEATURES OF STRICT 2 PHASE LOCKING PROTOCOL.EXPLAIN WITH A SUITABLE EXAMPLE HOW CASCADING ROLLBACKS CAN BE AVOIDED USING STRICT PHASE LOCKING.

(B) elaborate DEADLOCKS? elaborate TRANSACTION WAIT FOR GRAPHS? describe PHANTOM DEADLOCKS AND explain A PROTOCOL FOR DETECTION OF A DEADLOCK AND discuss HOW DETECTION OF PHANTOM DEADLOCKS MAY BE AVOIDED.

(C) WRITE SHORT NOTE ON FOLLOWING:-

(i) TIME STAMP BASED PROTOCOLS

(ii) checkpoints.

Earning:   Approval pending.