Advanced Database Management System - Tutorials and Notes: CS2255 Database Management Systems question paper - Apr/May 2011

Thursday, 8 May 2014

CS2255 Database Management Systems question paper - Apr/May 2011

CS2255 Database Management Systems question paper - Apr/May 2011/ Anna University Previous Year Exam Questions / Anna University Previous Year Computer Science and Information Technology Question Papers





Question Paper Code : 11259
B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2011
Fourth Semester
Computer Science and Engineering
CS2255 — DATABASE MANAGEMENT SYSTEMS
(Common to Information Technology)
(Regulation 2008)
Time: Three hours Maximum: 100 Marks
Answer ALL Questions

PART A — (10 × 2 = 20 Marks)

1. Who is a DBA? What are the responsibilities of a DBA?
2. What is a data model? List the types of data models used.
3. What is embedded SQL? What are its advantages?
4. What is the difference between tuple relational calculus and domain relational calculus?
5. What is meant by lossless-join decomposition?
6. A relation R = {A, B, C, D} has FD’s F = {AB → C, C → D, D → A}. Is R is in 3NF?
8. What are two pitfalls (problems) of lock-based protocols?
9. What are the advantages and disadvantages of indexed sequential file?
10. What is database tuning?

PART B — (5 × 16 = 80 Marks)

11. (a) (i) With a neat diagram, explain the structure of a DBMS. (9)
(ii) Draw an E-R diagram for a small marketing company database, assuming your own data requirements. (7)
Or
(b) (i) Compare the features of file system with database system. (8)
(ii) Explain the differences between physical level, conceptual level and view level of data abstraction. (4)
(iii) Mention any four major responsibilities of DBA. (4)
12. (a) (i) Consider the following relational database
Employee(employee-name, street, city)
Works( employee-name, company-name, salary)
Company(company-name, city)
Manages(employee-name, manager-name)
Give an expression in SQL to express each of the following queries :
Find the names and cities of residence of all employees who work for XYZ Bank.
Find the names, street address, and cities of residence of all employees who work for XYZ Bank and earn more than Rs. 10,000 per annum.
Find the names of all employees in this database who live in the same city as the company for which they work.
Find the names of all employees who live in the same city and on the same street as do their managers. (4 × 3 = 12)
(ii) Define the term distributed database management system and mention the issues to be considered in the design of the same. (4)
Or
(b) (i) What are the relational algebra operations supported in SQL? Write the SQL statement for each operation. (12)
(ii) What is data integrity? Explain the types of integrity constraints. (4)
13. (a) (i) Explain 1NF, 2NF, 3NF and BCNF with suitable example. (8)
(ii) Consider the universal relation R = {A, B, C, D, E, F, G, H, I} and the set of functional dependencies F = {(A, B) → C, A → (D, E), B → F, F → (G, H), D → (I, J)}. What is the key for R? Decompose R into 2NF, then 3NF relations. (8)
Or
(b) What are the pitfalls in relational database design? With a suitable example, explain the role of functional dependency in the process of normalization. (16)
14. (a) (i) Explain about immediate update and deferred update recovery techniques. (8)
(ii) Explain the concepts of serializability. (8)
Or
(b) (i) Explain Two-phase locking protocol. (8)
(ii) Describe about the deadlock prevention schemes. (8)
15. (a) (i) List the different levels in RAID technology and explain its features. (12)
(ii) Describe the different methods of implementing variable length records. (4)
Or
(b) (i) Explain the various indexing schemes used in database environment. (12)
(ii) Let relations r1(A, B, C) and r2(C, D, E) have the following properties : r1 has 20,000 tuples, r2 has 45,000 tuples, 25 tuples of r1 fit on one block, and 30 tuples of r2 fit on one block. Estimate the number of block accesses required, using each of the following join strategies for r1 Natural Join r2 : (4)
(1) Nested-loop join with r1 as outer relation
(2) Block nested-loop join with r1 as outer relation
(3) Merge join if r1 and r2 are initially sorted
(4) Hash join (assuming that no overflow occurs).


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