0% found this document useful (0 votes)
447 views7 pages

CS 601 PDF

This document contains a database management systems exam with multiple choice, short answer, and long answer questions. It tests knowledge of database concepts like the three schema architecture, relational algebra operations, normalization, transactions, concurrency control, and recovery techniques. The exam contains questions on topics such as functional dependencies, integrity constraints, query processing, and indexing structures like B-trees.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
447 views7 pages

CS 601 PDF

This document contains a database management systems exam with multiple choice, short answer, and long answer questions. It tests knowledge of database concepts like the three schema architecture, relational algebra operations, normalization, transactions, concurrency control, and recovery techniques. The exam contains questions on topics such as functional dependencies, integrity constraints, query processing, and indexing structures like B-trees.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Name : ……………………………………………………………

htt
Roll No. : ………………………………………………………...
Invigilator's Signature : ……………………………………….
CS/B.Tech/CSE/New/SEM-6/CS-601/2013
p:/
2013
DATABASE MANAGEMENT SYSTEM
Time Allotted : 3 Hours Full Marks : 70
/q
The figures in the margin indicate full marks.
Candidates are required to give their answers in their own words
pap
as far as practicable.

GROUP – A
( Multiple Choice Type Questions )
1. Choose the correct alternatives for the following :
er.

10 1 = 10

i) In the relational modes, cardinality is termed as

a) number of tuples
wb

b) number of attributes

c) number of tables

d) number of constraints.
ut .

ii) Relational calculus is a

a) procedural language
a c.

b) non-procedural language

c) data definition language

d) high level language.


in

6102 [ Turn over


CS/B.Tech/CSE/New/SEM-6/CS-601/2013

iii) Cartesian product in relational algebra is


htt
a) a unary operator b) a binary operator

c) a ternary operator d) not defined.


p:/
iv) DML is provided for
/q
a) description of logical structure of database
pap
b) addition of new structures in the database system

c) manipulation & processing of database

d) definition of physical structure of database


er.

system.

v) In a relational model, relations are termed as


wb

a) Tuples b) Attributes
ut .

c) Tables d) Rows.

vi) In case of entity integrity, the primary key may be


a c.

a) not Null b) Null

c) both Null & not Null d) any value.


in

6102 2
CS/B.Tech/CSE/New/SEM-6/CS-601/2013

vii) In an E-R diagram an entity set is represented by a


htt
a) rectangle b) ellipse

c) diamond box d) circle.


p:/
viii) Which of the following operations is used if we are

interested in only cetain columns of a table ?


/q
a) PROJECTION b) SELECTION
pap

c) UNION d) JOIN.

ix) Which of the following is a comparison operator in

SQL ?
er.

a) = b) LIKE

c) BETWEEN d) All of these.


wb

x) Using relational algebra the query that finds customers,

who have a balance of over 1000 is


ut .

a) Customer_name( balance > 1000 (Deposit) )

b) Customer_name( balance > 1000 (Deposit) )


a c.

c) Customer_name( balance > 1000 (Borrow) )

d) Customer_name( balance > 1000 (Borrow) ).


in

6102 3 [ Turn over


CS/B.Tech/CSE/New/SEM-6/CS-601/2013

GROUP – B
( Short Answer Type Questions )
htt
Answer any three of the following. 3 5 = 15

2. Explain in brief 3-schema architecture of DBMS.


p:/
3. Explain with example super key, candidate key and primary

key.
/q
4. What is cardinality ratio ? What is the difference between

procedural and non-procedural DML ? What is disjointness


pap
constraint ? 1+2+2

5. Describe three layer architecture of DBMS.

6. Indicate the advantage of DBMS over conventional file


er.

system.
GROUP – C
( Long Answer Type Questions )
Answer any three of the following. 3 15 = 45
wb

7. a) What do you mean by integrity constraint ?

b) What is lossless decompostion ?

c) What do you mean by closure ?


ut .

d) Suppose that we decompose the schema,

R = ( A, B, C, D ) into ( A, B, C ) and ( A, D, E ).
a c.

Show that this decomposition is lossless decomposition,

if the following set F of FDs holds —

A BC, CD E, B D, E A. 2+2+2+9
in

6102 4
CS/B.Tech/CSE/New/SEM-6/CS-601/2013

8. a) State two-phase commit protocol and discuss the


htt
implications of a failure on the part of

i) the coordinator
p:/
ii) a participant, during each of the two phases.

b) Describe the wait-die and wound-wait protocols for


/q
deadlock prevention.
pap
c) Define three concurrency problems : dirty read, non-

repeatable read, phantoms.

d) Let T1, T2 and T3 be transactions that operate on the


er.

same data items A, B and C. Let r1(A) mean that T1

reads A w1(A) means that T1 writes A and so on for T2


wb

and T3.

Consider the following schedule :


ut .

S1 : r2(c), r2(B), w2(b), r3(B), r3(C), r1(A), w1(A), w3(B),

w3(C), r2(A), r1(B), w1(B), w2(A)


a c.

Is the schedule serializable ?

e) What are the roles of Analysis, Redo and Undo phases

in the recovery algorithm 'ARIES' ? 4+2+3+3+3


in

6102 5 [ Turn over


CS/B.Tech/CSE/New/SEM-6/CS-601/2013

9. a) When do we call a relation is in 3NF ?


htt
b) Consider the relation assignment {worker_id,

building_id, startdate, name skilltype} and FDs are


p:/
{worker_id->name, (worker_id, building_id)->startdate}.

Is the relation in 2NF ? If not, then make it in 2NF.


/q
c) Describe Boyce-Codd normal form with example.

d) What is Query Tree ? Why we need query tree ?


pap

Consider the query "SELECT EMP_NAME FROM

EMPLOYEE, WORK_ON, PROJECT WHERE

PROJECT_NAME='ASSEMBLY' AND PRJ_NO='P1'AND


er.

JPOIN_DATE='21-12-12'. Construct a query tree for

this query. 1+4+3+(1+2+4)


wb

10. a) What is trnasacton ?

b) What is ACID property ?


ut .

c) Explain with example serial and serializable schedule.

d) What are the problems of concurrent execution of


a c.

transaction ?

e) Explain with the help of precedence graph the conflict

and non-conflict serializability. 1+3+4+3+4


in

6102 6
CS/B.Tech/CSE/New/SEM-6/CS-601/2013

11. Write short notes on any three of the following : 3 5


htt
a) Functional dependency

b) Dead lock
p:/
c) Transaction state diagram
/q
d) B-tree

e) Data Dictionary.
pap
er.
wb
ut .
a c.
in

6102 7 [ Turn over

You might also like