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

Database Management System - Dec 18

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. What are the responsibilities of the DBA and Database Designer?
(6 marks) 00

1.b With neat diagram, explain “three schema Architecture”.
(5 marks) 00

1.c Discuss the different types of user friendly interfaces and the types of user who typically use each.
(5 marks) 00

Or

2.a Explain with block diagram the different phases of database design.
(8 marks) 00

2.b Draw an ER -Diagram of movie database. Assume your own entities (minimum 4) attributes and relationships.
(5 marks) 00

3.a Discuss the characteristics of relations.
(6 marks) 00

3.b Outline the steps to convert the basic ER Model to relational Database schema.
(6 marks) 00

3.c Define the following:

i) Relation state

ii) Relation schema

iii) Arity

iv) Domain

(4 marks) 00

4.a Discuss the various types of set theory operations with example
(8 marks) 00

4,b Consider the two tables, show the results of the following:

enter image description here enter image description here

enter image description here

(5 marks) 00

5.a How does SQL implement the entity integrity constraints of the relational data model? Explain with an example.
(4 marks) 00

5.b Discuss: i) Shared variables ii) Communication variables.
(6 marks) 00

5.c Explain with examples in SQL:

i) Drop command

ii) Delete command

iii) Update command.

(6 marks) 00

6.a With program segment, explain retrieving of tuples with embedded SQL in C.
(6 marks) 00

6.b Consider the following tables:

works (Pname, Cname, Salary)

lives (Pname, Street, City)

located-In (Cname, City)

write the following queries in SQL:

i) List the names of the people who work for the company ‘Wipro’ along with the cities they live in

ii) Find the names of the persons who do not work for ‘Infosys’.

iii) Find the people whose salaries are more than that of all of the ‘oracle’ employees.

iv) Find the persons who works and lives in the same city

(10 marks) 00

7.a What do you mean by closure of attribute? Write an algorithm to find closure of attribute.

(6 marks) 00

7.b Explain any two informal quality measures employed for a relation schema design.
(4 marks) 00

7.c Given below are two sets of FDs for a relation R (A, B, C, D, E). Are they equivalent? i) A-> B , AB-> C , D-> AC , D->E

ii) A-> BC , D->AE

(6 marks) 00

8.a What do you mean by multivalued dependency? Explain the 4NF with example.
(6 marks) 00

8.b Suggest and explain three different techniques to achieve INF using suitable example.
(4 marks) 00

8.c Consider the following relation for CARSALE (CAR-NO, Date-Sold, Salesman No,Commission, Discount)

Assume a car can be sold by multiple salesman and hence primary key is{CAR_No, Salesman_No}.

Additional dependencies are

Date_Sold-> Discount

Salesman_No-> Commission

i) Is this relation in 1NF, 2NF or 3NF? Why or why not?

ii) How would you normalize this completely?

(6 marks) 00

9.a Discuss the ACID properties of a transaction
(4 marks) 00

9.b What are the anomalies occur due to interleave execution? Explain them with example.
(6 marks) 00

9.c Consider the three transactions T1, T2 and T3 and schedules S1 and S2 given below. Determine whether each schedule is serializable or not? If a schedule is serializable write down the equivalent serial schedule (S).

T1 : R1(x); R1(z); W1(x);

T2 : 2(x); R2(y); W2(z); W2(y);

T3 : R3(x); R3(y); W3(y);

S1 :R1(x); R2(z); R1(z); R3(x); R3(y); W1(x); W3(y); R2(y); W2(z); W2(y);

S2 :R1(x); R2(z); R3(x); R1(z); R2(y); R3(y); W1(x); W2(z); W3(y); W2(y);

(6 marks) 00

Or

10.a Describe the problems that occur when concurrent execution uncontrolled. Give examples
(6 marks) 00

10.b What is two phase locking? Describe with the help of an example
(4 marks) 00

10.c What is Deadlock? Consider the following sequences of actions listed in the order they are submitted to the DBMS. Sequence S1: R1(A); W2(B); R1(B); R3(C); W2(C); W4(B); W3(A) Draw waits-for graph in case of Deadlock situation.
(6 marks) 00

Please log in to add an answer.