Advanced Database Management System - Tutorials and Notes: Anna University CS1301 DBMS Question papers April May 2008

Thursday, 18 February 2016

Anna University CS1301 DBMS Question papers April May 2008

CS1301 Database Management Systems question paper - Apr-May 2008 / Anna University Previous Year Exam Questions / Anna University Previous Year Computer Science and Information Technology Question Papers / Anna University Previous Year CS1301 DBMS Exam Questions under Regulation 2004


B.E./B.Tech. DEGREE EXAMINATION, APR/MAY 2008
Fifth Semester
Computer Science and Engineering
CS 1301 — DATABASE MANAGEMENT SYSTEMS
(Regulation 2004)
Time: Three hours                                                              Maximum: 100 Marks
Answer ALL Questions
PART A — (10 × 2 = 20 Marks)
1. Define Data independence.
2. Distinguish between primary key and candidate key
3. With an example explain a weak entity in an ER diagram.
4. With an example explain referential integrity.
5. What is domain integrity? Give example.
6. Distinguish between dense and sparse indices.
7. List the properties that must be satisfied by a transaction,
8. Define deadlock.
9. State the advantages of distributed systems.
10. What is data warehousing?

PART B — (5 × 16 = 80 Marks)

11. (a) (i) Construct an ER diagram for a car insurance company that has a set of customers, each of whom owns one/more cars. Each car has associated with it zero to any number of recorded accidents. (8)
(ii) Construct appropriate tables for the above ER diagram. (8)
Or
(b) (i) Define data model. Explain the different types of data models with relevant examples. (10)
(ii) Explain the role and functions of the database administrator. (6)
12 (a) With relevant examples discuss the following in SQL.
(i) Data Definition Language. (4)
(ii) Data Manipulation Language (4)
(iii) Data Control Language (4)
(iv) Views (4)
Or
(b) What is normalization? Explain normalization techniques using functional dependencies with relevant examples. (16)
13 (a) Explain following with relevant examples:
(i) B tree (5)
(ii) B+ tree (5)
(iii) Static and dynamic hashing (6)
Or
(b) With a relevant example discuss the steps involved in processing a query. (16)
14 (a) Explain testing for serializability with respect to concurrency control schemes. How will you determine whether a schedule is serializable or not? (16)
Or
(b) Explain the following concurrency control:
(i) Lock based protocol (8)
(ii) Time stamp based protocol (8)
15 (a) State and explain the object oriented data model. Use banking application as an example. (16)
Or
(b) Write detail notes on following:
(i) Distributed Databases (8)
(ii) Data Mining (8)

*******************

 


Featured Content

Multiple choice questions in Natural Language Processing Home

MCQ in Natural Language Processing, Quiz questions with answers in NLP, Top interview questions in NLP with answers Multiple Choice Que...

All time most popular contents