B.Tech II Year I Semester (R15) Supplementary Examinations May/June-2019

DATABASE MANAGEMENT SYSTEMS

(Common to CSE & IT)

Time: 3 hours Max. Marks: 70

Note: 1. Question Paper consists of two parts (Part-A and Part-B)
2. Answering all sub questions from Part-A is compulsory
3. Answer any THREE questions from Part-B

PART – A (22 Marks)

1. 1. What is a database management system? Briefly explain the purpose of DBMS. (2M)

   --- Content provided by FirstRanker.com ---

   2. Define weak entity set with example. (2M)
   3. What is a view? What are its advantages? (3M)
   4. Define functional dependency. (2M)
   5. Explain the purpose of embedded SQL. (2M)
   6. How to achieve atomicity? Explain briefly. (3M)

   --- Content provided by FirstRanker.com ---

   7. Write about shadow paging. (3M)
   8. What are the advantages and disadvantages of B-tree index? (5M)

PART – B (48 Marks)

2. Explain E-R diagram components and give the E-R diagram for university database system.

--- Content provided by FirstRanker.com ---

3. Consider the following database:

   employee(employee-name, street, city)

   company(company-name, city)

   works(employee-name, company-name, salary)

   manages(employee-name, manager-name)

   --- Content provided by FirstRanker.com ---

   1. Give an expression in SQL for each of the following queries:
   2. Find the names of all employees who work for SP FirstRanker.com National FirstRanker.com Insurance FirstRanker.com Company.
   3. Find the names of all employees who live in the same city and on the same street as do their managers.
   4. Find the names of all employees who earn more than every employee of Small Bank Corporation.
   5. Assume that the companies may be located in several cities. Find all companies located in every city in which Small Bank Corporation is located.

   --- Content provided by FirstRanker.com ---

4. Consider relation R = {A, B, C, D, E, H} and the set of functional dependencies {A → B, BC → E, ED → H, A → C, C → D}

   1. Compute the closure of A⁺.
   2. Is {A} a candidate key for R?
   3. Is {BC} a candidate key for R?

   --- Content provided by FirstRanker.com ---

5. Explain in detail about different normal forms with examples.

6. Explain the following:

   1. Transaction state diagram.

   --- Content provided by FirstRanker.com ---

   2. ACID properties.

7. Explain the following:

   1. Static Hashing.
   2. Dynamic Hashing.

   --- Content provided by FirstRanker.com ---

WWW.FirstRanker.com