Punjab Engineering College 2007 B.E Computer Science DATABASE MANAGEMENT SYSTEMS - Question Paper

Computer Science B.E Cse cs1301-DBMS

B.E/B.Tech. DEGREE EXAMINATION,

FIFTH SEMESTER
(Regulation 2004)
Computer Science and Engineering
CS 1301-DATABASE MANAGEMENT SYSTEMS
Time: 3 hours Maximum : 100 marks
ans ALL ques..
PART-A (10*2=20 MARKS)
1. what is Database Management Systems? Why do we need a DBMS?
2. elaborate 3 characteristics of a Relational database system?
3. State the difference ranging from security and integrity.
4. What is decomposition and how does it address redundancy?
5. What is a heap file? How are pages organized in a heap file?
6. How does a B-tree differ from B+ trees? Why is B+ tree usually preferred as an access structure to a data file?
7. provide the meaning of the expression ACID transaction.
8. When are 2 schedules conflict equivalent?
9. describe the terms fragmentation and replication, in terms of where data is stored.
10. elaborate structured data types? elaborate collection types, in particular?
PART-B (5*16=80 MARKS)
11. (a) (i) discuss the component modules of a DBMS and their interactions with the architecture.(10)
(ii) Construct an ER diagram to a modal online book store.(6)
Or
(b) (i) discuss the basic relational algebra operations with the symbol used and example for every.(10)
(ii) explain about tuple relational calculus and domain relational calculus.(6)
12. (a) (i) Write short note on the following: (10 mark)
Data manipulation language(DML)
Data definition language(DDL)
Transaction control statement(TCS)
Data control language (DCL)
Data administration statements (DAS).
(ii) Consider the database provided by the subsequent schemas: (6 mark)
Customer( Cust _no, sales_ person _no, City)
Sales_person(sales_person_no,Sales_person_name,common_prec,year_of_hire)
provide the sql for the following:
Display the list of all customers by cust_no with the city in which every 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. (10mark)
(ii) explain how schema refinement through dependency analysis and normalization can improve schemas found through ER design.(6 mark)
13. (a) (i) define the various kinds of file organization? discuss using a sketch of every of them with their advantages and disadvantages. (10marks)
(ii) define static hashing and dynamic hashing. (6 marks)
Or
(b) (i) discuss the index schemas used in DBMS. (10 marks)
(ii)How does a DBMS represent a relational query valuation plan? (6 marks)
14. (a) (i) discuss Timestamp-based concurrency control protocol and the changes implemented in it. (10 marks).
(ii)Describe shadow paging recovery technique (6 marks)
Or
(b)(i) define strict two-phase locking protocol. (10 marks)
(ii) discuss the log based recovery technique (6 marks)
15. (a)(i) discuss 2-phase commitment protocol and the behavior of this protocol during lost messages and site failures. (12 marks)
(ii) define X path and X query with an example.(4 marks)
Or
(b)(i) discuss Data mining and data warehousing. (12 marks)
(ii) define the anatomy of XML document.

Earning:   Approval pending.