VTU Previous Year Question Papers BE CS Fifth Semester Database Management Systems June 2010

VTU Previous Year Question Papers BE CS Fifth Semester

Database Management Systems June 2010


Note: Answer any FIVE full questions, selecting at least TWO questions from each part


1 a. Briefly discuss the advantages of using the DBMS.)

b. Explain the component modules of DBMS and their interaction, with the help of a diagram.


2 a. Define an entity and an attribute; Explain the different types of attributes that occur in an ER model, with an sample.

b. Define the following with an example:

i) Weak entity type

ii) Participation constraints

iii) Cardinality ratio

iv) Ternary relationship

v) Recursive relationship.


3 a. Discuss the characteristics of a relation, with examples.

b. Briefly discuss the different types of update operations on relational database. Show an example of a violation of the referential integrity in each of the update operation.

c.   What is a valid state and an invalid state, with respect to a database?


4 a. Consider the following two tables Ti and T2. Show the results of the following operations:

b. Explain with mi example, the basic constraints that can be specified, when you create a table in SQL.


5 a. Explain the syntax of a SELECT statement in SQL. Write the SQL query for the following relation algebra expression.  Bdate, Address (oFname =” John’ AND Minit = B’ AND Lname =’ Smith’ (EMPLOYEE))

b.  Explain DROP command with an example.

c.   Consider the following tables:

WORKS (Pname, Cname, Salary)

LIVES (Pname, Street, City)

LOCATED-IN (Cname, City)

MANAGER (Pname, mgmame)

Write the SQL query for the following:

i)    Find the names of all persons who live in the city ‘Mumbai5.

ii)   Retrieve the names of all person of ‘Infosis’ whose salary is between Rs.30,000 and Rs.50,000.

iii)  Find the names of all persons who live and work in the same city.

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

v)     Find the average salary of all Infosians.


6 a. What is a functional dependency? Write an algorithm to find a minimal cover for a set of functional dependencies.

b.  What is the need for normalization? Explain second normal form. Consider the relation EMP-PROJ = {SSn,, Pnumber, Hours, Ename, Pname, Plocation}. Assume {SSn, Pnumber} as primary key. The dependencies are

SSn Pnumber —» {Hours}

SSn {Ename}

Pnumber -» {Pname, Plocation}.

Normalize the above relation into 2NF.


7 a. Explain multivalued dependency and fourth normal form, with an example.

b.  Let R – {SSn, Ename, Pnumber, Pname, Plocation, Hours} and D = }Ri, R2, R3}, where Ri – EMP = {SSn, Ename)

R2 = PROJ = {Pnumber, Pname, Plocation}

R3 – WORK-ON – {SSn, Pnumber, Hours}.

The following functional dependencies hold on relation R.

F = {SSn Ename ; Pnumber -» {Pname, Plocation};

{SSn, Pnumber} —» Hours}.

Prove that the above decomposition of relation R has the lossless join property.


8 a. Explain the problems that can occur when concurrent transactions are executed. Give examples.

b.  Briefly discuss the two phase locking protocol used in concurrency control.

Leave a Comment