No.of Printed Pages:4 IBICS-011I B.Tech.-VIEP -COMPUTER SCIENCE AND . . ENGINEERING (BTCSVI) 00283 Term-End Examination December, 2016
BleS-011 DATABASE MANAGEMENT SYSTEM
Time :.3 hours Maximum Marks: 70
Note: Attempt any Beven questions. All questions carry equal marks.

1. How does Database Management System (DBMS) differ from Filebase System Under what condition is it better to use Filebase System in place of DBMS? 5

Write short notes on any two of the following: 5

Centralized Databases

Distributed Databases

Relational Databases

2. List the languages, involved at various levels of ANSI-SPARC 3 level architecture. Categorize the SQL commands involved in languages, identified at respective levels of ANSI-SPARC 3 level architecture for DBMS. 5

Draw an ER diagram for the statement given below:

"Teachers teach students in an institution, affiliated to a University. The institution has several departments, viz. Engineering, Management, Journalism, etc."
Use appropriate notations, while drawing the diagram. 5

3. Using the attributes, entities and relations identified in prepare the database. Synchronize 1l'h.e prepared database with the ER diagram drawn in Q. 5

Differentiate between the following: 5

Generalization and Specialization

B-Tree and Tree

4. Given the relational schema:

Employee (Emp_code, Emp_name, Profession)
Product(P_code,P_name,P_details)
Job_function (Job_code, Title)
Assignment (Emp_code, P_Code, Job_code)

Write the relational algebra for the following queries 5

Find the details of employees working on project code 'comp353'.

Find the employee codes (Emp_code) of the employees who worked on all projects except project code 'comp353'.

Write the SQL equivalent of the relational algebra queries asked in Q. 5

5. Explain the anomalies that occur, when the relation is not in 2NF. Give suitable example in support of your explanation. 5

Do you agree with the statement "BCNF is stronger than 3NF". Give suitable arguments in support of your answer. 5

6. Discuss the concept of dependency preserving decomposition, with suitable examples. 5

Verify whether AB is the candidate key or not, for the relation
with the functional dependency set

5

7. Differentiate between serial schedule and serializable schedule. Draw the precedence graph for the transaction schedule given below and identify whether the schedule is serializable or not 5

(Transaction) T1 (Transaction) T2

Read

Read(X)
X=X+M
Write
Read(Y)
Write

Write

7. Write short notes on any two of the following: 5

2-Phase Locking

2-Phase Commit

Tuple Relational Calculus

8. Discuss Optimistic scheduling as a technique for concurrency control. Give suitable examples. 5

Discuss the Lost update problem with a suitable example. Violation of which property of database transaction contributes to this problem? 5