QUESTION PAPER CODE: C 3203
B.E./B.TECH. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2008
FIFTH SEMESTER
COMPUTER SCIENCE AND ENGINEERING
CS 1301 — DATABASE MANAGEMENT SYSTEMS
(COMMON TO B.E.(PART-TIME)FOURTH SEMESTER REGULATION 2005) (REGULATION 2004)
TIME: THREE HOURS MAXIMUM: 100 MARKS
ANSWER ALL QUESTIONS.
PART A — (10*2=20 MARKS)
1. What is Database management system? Why do we need DBMS?
2. What are the three characteristics of a Relational Database system?
3. State the differences between security and integrity.
4. What is decomposition and how does it address redundancy?
5. What us a heap file? How are pages organized in a heap file?
6. How does a B-tree differ from a B+ – tree? Why is a B+ – tree usually preferred as an access structure to a data file?
7. Give the meaning of the expression ACID transition.
8. When are two schedules conflict equivalent?
9. Define the terms fragmentation and replication, in terms of where data is stored.
10. What are structured data types? What are collection types, in particular?
PART B –(5*16=80 MARKS)
11(a) (i) Explain the component modules of a DBMS and their interactions with the architecture.[10]
(ii) Construct an ER diagram to a model online book store.[6]
Or
(b) (i) Explain the basic Relational Algebra operations with the symbol used and an example for each.[10]
(ii) Discuss about Tuple Relational calculus and Domain Relational Calculus.[6]
12 (a) (i) Write short notes on the following:[10]
Data Manipulation Language (DML)
Data Definition Language (DDL)
Transaction Control Statements (TCS)
Data Control Language (DCL)
Data Administration Statements (DAS).
(ii) Consider the database given by the following schemas:[6]
Customer(Cust_No,Sales_Person_No,City)
Sales_Person(Sales_Person_No,Sales_Person_Name,Common_Prec,Year_of_Hire)
Give an expression in SQL for each of the following queries:
Display the list of all customers by Cust_No with the city in which each is located.
List the names of the sales persons who have accounts in Delhi.
Or
(b) (i) Consider the universal relation R(A,B,C,D,E,F,G,H,I,J) and the set of FD’s.
G=({A,B}->{C}->{B,D}->{E,F},{A,D}->{G,H},{A}->{I},{H}->{J}) what is the key of R?
Decompose R into 2NF, then 3NF relations.[10]
(ii) Discuss how schema refinement through dependency analysis and normalization can improve schemas
Obtained through ER design.[6]
13 (a) (i) Describe the different types pf file organization? Explain using a sketch of each of them with their advantages and disadvantages.[10]
(ii) Describe static hashing and dynamic hashing.[6]
Or
(b) (i) Explain the index schemas used in database systems.[10]
(ii) How does a DBMS represent a relational query evaluation plan?[6]
14 (a) (i) Explain Timestamp-Based Concurrency Control protocol and the modifications implemented in it.[10]
(ii) Describe shadow paging recovery technique.[6]
Or
(b) (i) Describe Strict Two-phase Locking protocol.[10]
(ii) Explain Log based recovery technique.[6]
15 (a) (i) Explain 2-phase commitment protocol and the behaviour of this protocol
during lost messages and site failures.[12]
(ii) Describe X path and X query with an example.[4]
Or
(b) (i) Explain Data Mining and Data Warehousing.[12]
(ii) Describe the anatomy of XML document.[4]