-
8/14/2019 DBMS_ND06
1/3
T 8L25
B.E./8. TCCh. E GRtrE EXAMINATION, NOVEMBER/DECEMBER 2006.
Fifth Semester
Computer Science nd Engineering
CS 1301- DATABASE MANAGEMENT SYSTEMS
(Common o Information Technology nd B.E. Part-time R 2005 Fourth
Semester)
(Regulation 2004)
Time : Three hours Maximum : 100 marks
Answer ALL questions.
PA RTA - ( 1 0 x 2 = 2 0 m a r k s )
1. Compare database ystems with fi1e systems.
2. Give the distinction between primary key, candidate key, and
super key.
3. Write a SQL statement to find the names and loan numbers of
all customerswho have a loan at Chennai branch.
4. What is multivaiued dependency?
5. Give the measures of the quality of a disk.
6. What are the two types of ordered ndices?
7. List out the ACID properties.
8. What is Shadow paging?
9. Compare DBMS versus object-oriented DBMS.
10 . What is data warehousins?
PA RT B - ( 5 x 1 6 = 8 0 m a r k s )
11 . (a ) (i) Describe he system structure of a database ystem.
Q2)(ii) List out the functions of a DBA. @)
Or
(b) (i) Illustrate the issues to be considered while developing
anER-diagram. (8)
(ii) Consider he relational database
employee(empr-Iarne. treet, city)
rvorks(ernpnanre) ompanyname, alary)
w w w .
M a a n a
v a N .
c o m
-
8/14/2019 DBMS_ND06
2/3
company(companyname, ity)
manages empname' managername)
Give an expression n the relational algebraor each request:
(1) Find the names of all employeesrn'ho work for First Bank
CorPoration'
( 2 ) F i n d t h e n a m e s ' s t r e e t a d d r e s s e s '
a n d c i t i e s ' o f r e s i d e n c e o f a l lemployees *ho
*o'k for First Bank
Corporation and earn more
than 200000 Pe r annum'
( 3 ) F i n d t h e n a m e s o f a l i e m p l o y e e s i n t
h i s d a t a b a s e w h o l i v e i n t h esame city as tt"
"o-p""y
iot which they rn'ork'
Find the names of al l the employeeswho
employees of Small Bank Corporatron'
Discuss about tnggers' How do triggersoffer a powerful
mechanism
for dealing with the thu"g"t to u Jutabuse n'ith suitable
u"u*Ot,"i.,
earn more than everY, * * 2 = g )4)
L2 .(a ) (i )
(ii) What are nested queries? Explain u'ithexample'
suitable examPle'
Compare BCNF versus 3NF'
Describe about RAID leveis'
Explain why allocations of records oblocks affects database
system
performance significantlY'(6)
Or
Descr ibe thes t ruc tureofB*t reeandgive thea lgor i
thmforsearchin the B* tree with examPle'
,12)
Give thecompar isonbetweenorder.ed ' i r rdexingandhashing .
(4)
Explain the different forms of Serializabitity'(10)
What are different types of schedulesare acceptable for
recoverabiiity?
-Ertu ur'v! (6 )
(6)
Or
(b ) ( i )Wha t i sno rma l i za t i on?Give theva r iousno rma
l fo rmsof r e l a t i ona lschema and define ,
,"tution-*rri"r,
is in BCNF and explain with,].2)
(ii)
13. (a) (i)
(ii)
(4)
(10)
t4.
(b) (i )
(ii)
(a ) (i )
(ii)
Or
T 8125
w w w .
M a a n a
v a N .
c o m
-
8/14/2019 DBMS_ND06
3/3
(b) (i) Discuss on tr,'v'o-phase ocking protocol and
timestamp-basedprotocoi. Q2)
(ii) Write short notes on log-based ecovery. (4)
(i) Discuss in detail about the object relational databases and
its(8)advantages.
(ii) Illustrate the issues o implement distributed databases.
(8)
15. (a)
(b ) (i) Give the basic
(ii) What are the
Explain about
Or
structure of XML and its document schema. (8)
two important classes of data mining problems?
rule discovery using those classes. (8)
T 8125
w w w .
M a a n a
v a N .
c o m
