0
442views
Database Management System Question Paper - Dec 17 - Computer Science (Semester 5) - Visveswaraya Technological University (VTU)
1 Answer
0
4views

Database Management System - Dec 17

Computer Science (Semester 5)

Total marks: 80
Total time: 3 Hours
INSTRUCTIONS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Draw neat diagrams wherever necessary.

1.a. Explain the main characteristics of the database approach versus the file processing approach.
(8 marks) 00

1.b Explain the three - schema architecture with neat diagram. Why do we need mappings among schema levels? How do different schema definition languages support this architecture?
(8 marks) 00

Or

2.a Discuss with examples, different types of attributes.
(7 marks) 00

2.b Draw an ER diagram for a BANK database schema with atleast five entity types. Also specify primary key and structural constraints.
(9 marks) 00

3.a Describe the characteristics of relations with suitable example for each.
(8 marks) 00

3.b What are the basic operations that can change the states of relations in the database? Explain how the basic operations deal with constraint violations.
(8 marks) 00

Or

4.a Describe the steps of an algorithm for ER - to - relational mapping.
(10 marks) 00

4.b In SQL which command is used for table operation? Explain how constraints are specified in SQL during table creation with suitable example.
(6 marks) 00

5 Consider the COMPANY DATABASE

EMPLOYEE (Fname, Minit, Lname, Ssn, Bdate, Address, Sex, Salary, super-san, Dno)

DEPARTMENT (Dname, Dnumber, Mgr_ssn, Mgr_st_date)

DEPART_LOCATIONS(Dnumber, Dlocation)

PROJECT(Pname, Pnumber, Plocation, Dnum)

WORKS_ON(Essn, Pno, Hours)

DEPENDENT(Essn, Dependent_name, Sex, Bdate, Relationship).

Specify the following queries in SQL on the database schema given above:

5.a For every project located in Stafford, list the project number the controlling department number and the department manger's last name, address, and birth date.
(4 marks) 00

5.b List the names of all employees
(2 marks) 00

5.c For each project name and the total hours per week(by all employees) spent on that project.
(4 marks) 00

5.d Retrieve the name of each employee who works on all projects controlled by 'Research' department.
(6 marks) 00

Or

6.a Define Stored Procedure. Explain the creating and calling of procedure with suitable example.
(8 marks) 00

6.b Explain the Single - tier and Client - server architecture, with neat diagram.
(8 marks) 00

7.a Explain the informal design guidelines used as measures t determine the quality of relation schema design.
(8 marks) 00

7.b Define Normal form. Explain 1NF, 2NF and 3NF with suitable examples for each.
(8 marks) 00

Or

6.a Define Minimal cover. Write an algorithm for finding a minimal cover F for a set of functional dependencies E. Find the minimal cover for the cover for the given set of Ds be E:{ B-> A, D-> A, AB -> D}.
(8 marks) 00

8.b Consider the universal relation R = {A,B,C,D,E,F,G,H,I,J} and the set of functional dependencies

F = {{A,B}->{C}, {A} -> {D,E}, {B}->{F},{F} -> {G,H}, {D}-> {I,J}.

Determine whether each decomposition has the lossless join property with respect to F.

D1 = {R1 , R2 ,R 3} ; R1 ={A,B,C,D,E}; R2 = {B,F,G,H} ; R3 = {D,I,J}.

(5 marks) 00

9.a Why Concurrency control is needed demonstrated with example?
(12 marks) 00

9.b Discuss the desirable properties of transactions.
(4 marks) 00

10.a When deadlock and starvation problems occurs? Explain how these problems can be resolved.
(9 marks) 00

10.b Explain how shadow paging helps to recover from transaction failure.
(7 marks) 00

Please log in to add an answer.