DATABASE MANAGEMENT SYSTEMS

YEAR : II SEMESTER : IV SUBJECT CODE : CS2255

UNIT I INTRODUCTION 1. With block diagram, discuss briefly the various levels of data abstraction. 2. Specify with suitable examples, the different types of keys used in Database Management System. 3. Distinguish between physical and logical data independence. 4. What is meant by an instance of the database and schema? 5. Define Database Management System. 6. Compare Network model with Hierarchical model. 7. Discuss briefly about the major disadvantages of keeping organizational information in a file processing system. 8. a. What are data models and how are they grouped? b. Explain in detail any two models with sample databases. 9. With the help of block diagram explain the basic structure of DBMS. 10. a. What are the advantages of having centralized control of data? Illustrate your answer wit suitable example. b. Explain the logical structure of a database wit the help of a sample E-R diagram. UNIT II RELATIONAL MODEL 1. Explain the basic structure of an SQL expression. 2. What is a view and how is it created? Explain with an example. 3. Is it possible for several attributes to have the same domain? Illustrate your answer with suitable example. 4. What is embedded SQL? 5. List the various join operations. 6. What is trigger in SQL? 7. What is referential integrity? 8. a. Assume a sample database, and explain how add, remove or change information in the database. b. Write short notes on DDL statements with an example. 9. a. With the help of suitable examples, explain the traditional set operations. b. What are aggregate functions? Discuss with examples the five built-in aggregate functions offered by SQL. 10. 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 give an expression in SQL for the following queries: * Find the name 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 companies for which they work * Find the name of all the employees who earn more than every employee of Small Bank Corporation. 11. With relevant examples discuss the following in SQL a.) Data Definition Language b.) Data Manipulation Language c.) Data Control Language d.) Views 12. a. Discuss the different types of Distributed Databases. b. Explain the various approaches used for storing a relation in Distributed Database. UNIT III DATABASE DESIGN 1. Describe briefly any two undesirable properties that a bad database design may have. 2. Describe BCNF and describe a relation which is in BCNF. 3. Explain with a simple example, the lossless-join decomposition. 4. Define Functional Dependency with an example. 5. Why is it necessary to decompose a relation? 6. What is multi-valued dependency? 7. With relevant examples discuss First, Second, Third normal forms and BCNF. 8. a. What is normalization? Explain the various normalization techniques with suitable example. / What is normalization? Give the various normal forms of relational schema and define a relation which is in BCNF with suitable example. b. Explain the basic concepts of functional dependencies with examples. 9. a. What is FD? Explain the role of FD in the process of normalization? b. Discuss how schema refinement through dependency analysis and normalization can improve schemas obtained through E-R design? 10. What is normalization? Explain normalization techniques using functional dependencies with relevant examples. 11. i) Consider the universal relation R(A, B, C, D, E, F, G, H, I, J) and the setoff FDs G = ({A,B} -> {C} -> {B,D} -> {E,F}{A,D} -> {G,H},{A} -> {I}, {H}-> {J}) What is the key R? Decompose R into 2NF, then 3NF relations. ii) Discuss how schema refinement through dependency analysis and normalization can improve schemas obtained through ER design. UNIT IV TRANSACTIONS 1. Why is it necessary to have control of concurrent execution of transactions? How is it made possible? 2. What is transaction? Explain with an example. 3. What is timestamp ordering scheme? Specify two simple methods for implementing this scheme. 4. What are the various properties of transaction that the database system maintains to ensure integrity of data.

5. What are ACID properties? Explain usefulness of each. 6. What benefit is provided by strict-two phase locking? What are the disadvantages result? 7. Define deadlock. 8. Explain in detail ACID properties of transactions. 9. Explain in detail concurrency control and recovery. 10. a. Illustrate states of transaction. b. Explain the two approaches to deadlock prevention. 11. a. Explain in detail the four fundamental problems that occur if the transactions are not handled properly. b. Explain the distinction between the terms serial schedule and serializable schedule with suitable example. 11. a. What is locking? Explain the various locking techniques used to handle the concurrent SQL transaction for simultaneous uses. Give example for each locking. b. Discuss about the testing of serializability. 12. Discuss on two-phase locking protocol and timestamp based protocol. UNIT V IMPLEMENTATION TECHNIQUES 1. Give a diagrammatic representation to indicate the basic steps in query processing. 2. What are the merits and demerits of B+ - tree index structure? 3. What is pipelining and how does it help? 4. Give the measures of the quality of a disk. 5. What are the two types of ordered indices? 6. Compare sequential access device versus a random access device with an example. 7. What can be done to reduce the occurrence of bucket overflows in a hash file organization? 8. a. What are the different types of storage media? b. What components are included in query processing? 9. a. Discuss about Static and Dynamic Hashing. b. What is the use of an index structure and explain the concept of ordered indices. 9. a. What is meant by complex selection? Explain its implementation with suitable example. b. Why is Hash structure not the best choice for a search key on which range queries are likely? 10. a. Give the comparison between ordered indexing and hashing. b. Describe the structure of B+ - tree and list its characteristics. 11. Describe about RAID levels. 12. With a relevant example discuss the various steps involved in processing a query. 13. Describe the various types of file organization. Explain using sketch of each of them with their advantages and disadvantages.