B.E./B.Tech. DEGREE EXAMINATIONS, MAY/JUNE 2010.

FOURTH SEMESTER COMPUTER SCIENCE AND ENGINEERING CS 46 DATA BASE MANAGEMENT SYSTEMS (Common to Information Technology) (REGULATIONS 2008) Time :Three hours Answer ALL questions. PART A (10 x 2 = 20 marks) 1. Differentiate File systems and Database management system. 2. What is logical data independence? 3. Write the Tuple relational calculus expression to find the number of employees working in Sales department in the given relation Employee. Employee (SSN-No, Name, Department) 4. Define triggers. 5. When is a functional dependency said to be trivial? 6. What are the pitfalls of Database design? 7. What are ACID properties? 8. What are the facilities available in SQL for Database recovery? 9. What is stripping and mirroring? 10. Differentiate static and dynamic hashing. PART B (5 x 16 = 80 marks) 11. (a) (i) Explain the Database Management System architecture with a neat diagram. (10) (ii) What are the need for the development of relational databases? (6) Or (b) Draw the ER-diagram to design a system for a Publishing Company that produces scientific books on various subjects. The books are written by authors who specialize in one particular subject. The company employs editors who not necessarily being specialists in a particular area, each take sole responsibility for editing one or more publications. A publication covers essentially one of the specialist subjects and is normally written by a single author. When writing a particular book, each author works with editor, but may submit another work for publication to be supervised by other editors. To improve their competitiveness, the company tries to employ a variety of authors, more than one author being a specialist in a particular subject. 12. (a) (i) Explain briefly about various relational algebra expressions with examples. (8) (ii) Discuss about the evolution of distributed database. Compare with client/server mode. (8) Or Maximum : 100 marks

(b) Consider the relational table given below and answer the following SQL queries. Employee(SSN-No, Name, Department, Salary) (i) List all the employees whose name starts with the letter 'L'. (ii) Find the maximum salary given to employees in each department. (iii) Find the number of employees working in 'accounts' department. (iv) Find the second maximum salary from the table. (v) Find the employee who is getting the minimum salary. 13. (a) What is normalization?fExplain first, second and third normal forms with an example describing the advantages of normalization. Or (b) Explain briefly about Armstrong rules on functional dependency and write the algorithm to compute functional dependency closure. 14. (a) Explain briefly about the working of two phase locking protocol using a sample transaction. Or (b) (i) When is a transaction said to be deadlocked? Explain the deadlock prevention methods with an example. (8) (ii) Explain concurrency control mechanisms. Discuss the need with example. (8) 15. (a) (i) Draw and explain the structure of B+ tree index files. (10) (ii) Write notes on RAID. (6) Or (b) (i) Explain briefly about query processing with examples to perform sort and join operation. (10) (ii) Discuss the approaches of database tuning. (6)

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 FDs. 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]

Time: 3 hours

B.E/B.Tech DEGREE EXAMINATION Apr/May 2008 Fifth semester Computer Science and Engineering CS1301 -DATABASE MANAGEMENT SYSTEMS (Regulation 2004) Maximum marks: 100 Answer ALL questions PART A (10 x 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 x 16 = 80) 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) (i) 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)

Time: 3 hours

B.E/B.Tech DEGREE EXAMINATION May/Jun 2007 Fifth semester Computer Science and Engineering CS1301 -DATABASE MANAGEMENT SYSTEMS (Regulation 2004) Maximum marks: 100 Answer ALL questions PART A (10 x 2 =20 marks)

1. List Five Responsibilities of the DB manager. 2. Give the limitations of E-R model? How do you overcome this? 3. Define Query language. Give the classification of the query language. 4. Why it is necessary to decompose a relation? 5. Give any two advantages of sparse index over dense index. 6. Name the different types of joins supported in SQL. 7. What are the types of transparencies that a distributed database must support? Why? 8. What benefit is provided by strict-two phase locking? What are the Disadvantages result? 9. Briefly write the overall process of data warehousing. 10. What is an active database? PART B (5 x 16 = 80) 11. (a) (i) What are the types of knowledge discovered during data mining? Explain with suitable example. (8) 11. (a) (ii) Highlight the features of object oriented database (8) (or) 11. (b) (i)What is nested relations? Give example. (8) 11. (b) (ii) Explain the structure of XML with suitable example. (8) 12. (a) (i) Compare file system with database system (8) 12 (a) (ii) Explain the architecture of DBMS. (8) (or) (b) (i) What are the steps involved in designing a database application? Explain with an application. (10) (ii) List the possible types of relations that may exist between two entities. How would you realize that into tables for a binary relation? (6) 13 (a) (i) What are relational algebra operations supported in SQL? Write the SQL statement for each operation. (8) (ii) Justify the need for normalization with examples. (or) 13 (b) (i) What is Normalization? Explain 1NF, 2NF, 3NF and BCNF with suitable example (b) (ii) What is FD? Explain the role of FD in the process of normalization. (8) 14 (a) (i) Explain the security features of provided in commercial query languages. (8)

(ii) What are the steps involved in query processing? How would you estimate the cost of the query? (8) (or) (b) (i) Explain the different properties of indexes in detail (8) (ii) Explain various hashing techniques? (8) 15. (a) (i) Explain the four important properties of transaction that a DBMS must ensure to maintain database. (8) 15. (a) (ii) What is RAID? List the different levels in RAID technology and explains its features. (8) (or) 15. (b) (i) What is concurrency control? How is it implemented in DBMS? Explain. (8) 15. (b) (ii) Explain various recovery techniques during transaction in detail. (8)

Time: 3 hours

B.E/B.Tech DEGREE EXAMINATION Nov/Dec 2006 Fifth semester Computer Science and Engineering CS1301 -DATABASE MANAGEMENT SYSTEMS (Regulation 2004) Maximum marks: 100 Answer ALL questions PART A (10 x 2 =20 marks)

1. Compare database systems with file systems. 2. Give the distinction between primary key, candidate key and super key. 3. Write a SQL statement to find the names and loan numbers of all customers who have a loan at Chennai branch. 4. What is multivalued dependency? 5. Give the measures of the quality of the disk? 6. What are the two types of ordered indices? 7. List out the ACID properties. 8. What is shadow paging? 9. Compare DBMS versus object oriented DBMS. 10. What is Data warehousing? PART B (5 x 16 = 80) 11. (a) (i) Describe the system structure of database system. (12) (ii) List out the functions of DBA (4) (or) (b) (i) Illustrate the issues to be considered while developing an ER-diagram. (8) (ii) Consider the relational database employee (empname, street, city) works (empname, companyname, salary) company (companyname, city) manages (empname, managername). Give an expression in the relational algebra for each request. Find the names of all employees who work for first bank Corporation. Find the names, street addresses and cities of residence of all employees who work for first bank corporation and earn more than 200000 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 earn more than every Employees of small Bank Corporation. (4 * 2 = 8) 12. (a) (i) Discuss about triggers. How do triggers offer a powerful mechanism for dealing with the changes to database with suitable example. (10)

(ii) What are nested queries? Explain with example. (6) (or) (b) (i) What is normalization? Give the various normal forms of relational schema and define a relation which is in BCNF and explain with suitable example. (12) (ii)Compare BCNF versus 3NF. (4) 13. (a) (i) Describe about RAID levels. (10) (ii) Explain why allocations of records to blocks affects database system performance significantly. (6) (or) (b) (i) Describe the structure of B+ tree and give the algorithm for search in the B+ tree with example. (12) (ii) Give the comparison between ordered indexing and hashing 14. (a) (i) Explain the different forms of Serializability. (10) (ii) What are different types of schedules are acceptable for recoverability? (6) (or) (b) (i) Discuss on two-phase locking protocol and timestamp-based protocol. (12) (ii) Write short notes on log-based recovery. (4) 15. (a) (i) Discuss in detail about the object relational database and its advantages. (8) (ii) Illustrate the issues to implement distributed database. (8) (or) (b) (i) Give the basic structure of XML and its document schema. (8) (ii) What are the two important classes of data mining problems? Explain about rule discovery using those classes. (8)

B.E/B.Tech DEGREE EXAMINATION Nov/Dec 2007 Fifth semester Computer Science and Engineering CS1301 -DATABASE MANAGEMENT SYSTEMS (Regulation 2004) Maximum marks: 100 Answer ALL questions PART A (10 x 2 =20 marks) 1. List any two advantages of database systems. 2. Give the reasons why null values might be introduces into the database. 3. What is static SQL? How does it differ from dynamic SQL? 4. What are the different types of integrity constraints used in designing a relational database? 5. Compare sequential access devices versus random access devices with an example. 6. What can be done to reduce the occurrences of bucket overflows in a hash file organization? 7. Give the ACID properties. 8. State the benefits of strict two-phase locking. 9. What is the need for complex data types? 10. What is data mining? PART B (5 x 16 = 80) 11. (a) Explain the system structure of a database system with neat block diagram. (16) (or) (b) (i) Construct an ER-diagram for hospital with a set of patients and a set of medical doctors. Associate with each patient a log of the various tests and examinations conducted. (8) (ii) Discuss on various relational algebra operators with suitable Example. (8) 12. (a) (i) Consider the employee database, where the primary keys are underlined. Employee (empname, street, city) Works (empname, companyname, salary) Company (companyname, city) Manages (empname, managername) And given an expression in SQL for the following queries: (1) Find the names of all employees who work for First Bank Corporation. (2) Find the names, street addresses, and cities of residence of all employees who work for First Bank Corporation and earn more than 200000 per annum. (3) Find the names of all employees in this database who live in the same city as the companies for which they work. (4) Find the names of all the employees who earn more than every employees of Small Bank

Time: 3 hours

Corporation. (4 * 2 = 8) (ii) Discuss the strengths and weaknesses of the trigger mechanism. Compare triggers with other integrity (8) (or) (b) (i) What is normalization? Explain the various normalization techniques with suitable example. (12) (ii) Give the comparison between BCNF and 3NF. (4) 13. (a) (i) Explain how the RAID system improves performance and reliability. (8) (ii) Describe the structure of B+ tree and list the characteristics of a B+ tree. (8) (or) (b) (i) Explain the steps involved in processing a query. (8) (ii) Give the algorithm for hash join. (8) 14. (a) (i) Describe about the testing of serializability. (6) (ii) Discuss on two-phase locking protocol. (10) (or) (b) (i) Explain the differed and immediate-modification versions of the log-based recovery scheme (10) (ii) Write the short notes on shadow paging (6) 15 (a) (i) Highlight the features of OODBMS (8) (ii) Write short notes on distributed databases (8) (or) (b) (i) Give the structure of XML data. (4) (ii) Explain the architecture of a typical data warehouse and Describe the various components of data warehouse. (12)