2013 Database Management System: CS/B.Tech/CSE/New/SEM-6/CS-601/2013
2013 Database Management System: CS/B.Tech/CSE/New/SEM-6/CS-601/2013
2013 Database Management System: CS/B.Tech/CSE/New/SEM-6/CS-601/2013
om
Candidates are required to give their answers in their own words
as far as practicable
GROUP – A
t.c
( Multiple Choice Type Questions )
1. Choose the correct alternatives for the following :
bu
10 1 = 10
a) number of tuples
b) number of attributes
c) number of tables
m
d) number of constraints.
a) procedural language
b) non-procedural language
b)
om
addition of new structures in the database system
t.c
c) manipulation & processing of database
system.
yw
a) Tuples b) Attributes
m
c) Tables d) Rows.
6102 2
CS/B.Tech/CSE/New/SEM-6/CS-601/2013
a) rectangle b) ellipse
om
a) PROJECTION b) SELECTION
c) UNION d) JOIN.
t.c
ix) Which of the following is a comparison operator in
SQL ?
bu
a) = b) LIKE
yw
GROUP – B
( Short Answer Type Questions )
Answer any three of the following. 3 5 = 15
key.
om
procedural and non-procedural DML ? What is disjointness
constraint ? 1+2+2
system.
GROUP – C
( Long Answe Type Questions )
yw
R = ( A, B, C, D ) into ( A, B, C ) and ( A, D, E ).
A BC, CD E, B D, E A. 2+2+2+9
6102 4
CS/B.Tech/CSE/New/SEM-6/CS-601/2013
i) the coordinator
deadlock prevention.
c)
om
Define three concurrency problems : dirty read, non-
and T3.
om
d) What is Query Tree ? Why we need query tree ?
transaction ?
6102 6
CS/B.Tech/CSE/New/SEM-6/CS-601/2013
a) Functional dependency
b) Dead lock
d) B-tree
om
e) Data Dictionary.
t.c
bu
yw
m