A7-R3: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS NOTE:

1.

There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. PART ONE is to be answered in the TEAR-OFF ANSWER SHEET only, attached to the question paper, as per the instructions contained therein. PART ONE is NOT to be answered in the answer book.

2.

Maximum time allotted for PART ONE is ONE HOUR. Answer book for PART TWO will be supplied at the table when the answer sheet for PART ONE is returned. Howe er, candidates, who complete PART ONE earlier than one hour, can collect the answer book for PART TWO immediately after handin! o er the answer sheet for PART ONE. TOTAL TIME: 3 HOURS TOTAL MARKS: 100 (PART ONE 40; PART TWO 60)
3.

PART ONE (An !"# $%% &'" ()" &*+n , 1E$.' ()" &*+n /"%+! 0*1" $ 2)%&*3%" .'+*." +4 $n !"# - C'++ " &'" 2+ & $33#+3#*$&" +n" $n5 "n&"# *n &'" 6&"$#-+447 $n !"# '""& $&&$.'"5 &+ &'" ()" &*+n 3$3"#8 4+%%+!*n0 *n &#).&*+n &'"#"*n(1 9 10, A schema describes $ecord $elationship &ata 'lements $ecord and files All of the abo e

"." A# %# (#

D)

".) The physical location of a record is determined by a mathematical formula that transforms a file key in to a record location in A# A %*Tree +ile %# An indexed file (# A hashed file &# ,one of the abo e ".- An abstraction concept for buildin! composite ob.ects from their component ob.ect is called A# /peciali0ation %# ,ormali0ation (# 1enerali0ation &# A!!re!ation ".2 The 345, operator can be specified as A# $x / B) 6condition# 6$x/# (# %oth A# and %# D) ,one of the abo e

A7-R3

P$0" 1 +4 :

;$n)$#<8 =007

".7 The expression 6$8/#*66$*/#86/*$## is equi alent to A) $// B) $/ C) 6condition# 6$x/# D) 6$x/# ".9 A# %# (# A statement that is executed automatically by the system as a side effect of a modification to the database is known as Assertion Tri!!ers $eferential constraints ,one of the abo e An audit trail (an be used to restore lost information 5s used to make backup copies 5s the reco ered history of operations performed on a file All of the abo e

D)
".: A# %# (#

D)

".; A model used to describe data at the lo!ical and iew le el A# 4b.ect based lo!ical models %# $ecord based lo!ical models (# Physical models D) ,one of the abo e ".< A normal form in which e ery determinant is a key A# ),+ %# -,+ (# %(,+ &# 2,+ "."=A property which ensures that each functional dependency is represented in some indi idual relation resultin! after decomposition A# >oss less .oin %# &ependency preser ation C) %oth A# and %# D) ,one of the abo e

A7-R3

P$0" = +4 :

;$n)$#<8 =007

=-

E$.' &$&"2"n& /"%+! * "*&'"# TRUE +# FALSE- C'++ " &'" 2+ & $33#+3#*$&" +n" $n5 ENTER *n &'" 6&"$#-+447 '""& $&&$.'"5 &+ &'" ()" &*+n 3$3"#8 4+%%+!*n0 *n &#).&*+n &'"#"*n(1 9 10,

)." The referential inte!rity rule states that e ery forei!n key alue must match a key alue in an associated table. ).) $elational calculus employs procedural way for statin! queries. 2.3 The di ision operator can be expressed as a sequence of , ? and @ operations. 2.4 5n a hierarchical database, modelin! of many to many relations in achie ed by record replication. ).7 A forei!n key may not ha e null or partial null alues. 2.6 '$ dia!ram functions performed by a system. ).: &urin! the process of reco ery, each pair of physical blocks is examined. ).; /table stora!e is implemented by replicatin! the needed information in se eral non* olatile disks with independent failure modes. 2.9 Multi* alued dependency $.A $.% holds in $ iff the set of % alues matchin! a !i en 6A, (# pair in $ depends on both A and ( alues. 2.10 )@phase lockin! protocols ensures freedom from deadlock. 3- M$&.' !+#5 $n5 3'#$ " *n .+%)2n > !*&' &'" .%+ " & #"%$&"5 2"$n*n0? !+#5( ,?3'#$ "( , *n .+%)2n Y- En&"# <+)# "%".&*+n *n &'" 6&"$#-+447 $n !"# '""& $&&$.'"5 &+ &'" ()" &*+n 3$3"#8 4+%%+!*n0 *n &#).&*+n &'"#"*n(1 9 10, > -." -.) -.-.2 -.7 -.9 -.: -.; -.< -."= &&> ,ormali0ation 4uter*.oin (heck6 # clause in /A> &ashed 'llipses in '$ dia!ram &%A /hadow Pa!in! $elational Al!ebra Hierarchical model &eferred 8pdate ABCDEFGHI;KLMNOY /pecified a predicate that must be satisfied by e ery tuple in relation Authentication /pecifies a condition that is not to be (hecked &ata &ictionary $emo es $edundancy &eri ed attributes Multi* alued attributes ,o*force approach Tables Tree structure ,o*steal approach &eals with missin! information &atabase made up of fixed si0e pa!es 8sed to declare database schema Procedural

A7-R3

P$0" 3 +4 :

;$n)$#<8 =007

@-

E$.' &$&"2"n& /"%+! '$ $ /%$nA 3$." &+ 4*& +n" +4 &'" !+#5( , +# 3'#$ "( , *n &'" %* & /"%+!- En&"# <+)# .'+*." *n &'" 6&"$#-+447 $n !"# '""& $&&$.'"5 &+ &'" ()" &*+n 3$3"#8 4+%%+!*n0 *n &#).&*+n &'"#"*n(1 9 10, ADG;MTuples (losure Physical /peciali0ation Partitionin! BEHKNAcyclic 8nion Hierarchical (omposite A!!re!ation CFILO$eco ery mana!ement Primary $elations Beak entity set 5nte!rity (onstraints

2." 2.) 2.2.2 2.7 2.9 2.: 2.; 2.< 2."=

The process of desi!natin! sub*!roupin! within an entity set isCCCCCCCCC. An entity set that does not ha e sufficient attributes to form a primary key is known as CCCCCCC. A relation that is not part of lo!ical model but is made isible to a user as a irtual relation is called a6n# CCCCCCCCCCCCCCC. &urability is implemented in CCCCCCCCCCCCCCcomponent of database. The 8P&AT' command in /A> is used to modify attribute selected CCCCCCCCC. A forei!n key creates a6n# CCCCCCCC relationship between two associated entities. The CCCCCCC of a query consists of the tuples, which may be assi!ned to the free ariables of the well*formed formula. A key consistin! of more than one column is called a6n# CCCCCCCC. A6n# CCCCCCCC structure is a lo!ical data model that arran!es data accordin! to some natural hierarchy on a one*to*one basis. A lockin! protocol ensures conflict seriali0ability, iff for all le!al schedules, the associated relation is CCCCCCCCCCC. alues of one or more

A7-R3

P$0" @ +4 :

;$n)$#<8 =007

PART TWO 6Answer any FOUR questions# Ba# 'xplain the followin! &atabase terms with the help of an example* i# &ata 5ndependence ii# &omain iii# +orei!n Dey i # (ardinality # $eferential 5nte!rity 'xplain the purpose of tri!!ers in /A> with the help of an example. (C=9BDEB, :a# An insurance company wishes to create a database to keep track of its operations. A policy may be held by many policy holders. An a!ent sells policiesE with all policies bein! sold by only one a!ent. A policyholder is ser iced by only one a!ent. An a!ent normally works in one office, althou!h some a!ents work from home. An office may ha e se eral a!ents. Policy details held include the policy number, policy date, policy type and insurance amount. PolicyholderFs details include policyholder number, name, and address and phone number. A!ent details include a!ent code, a!ent name, salary and commission 6)G of total policy insurance amount sold#. 4ffice details include the office name, office address, office phone number and mana!er name. i# /tate the entity types with their identifier and the relationships, usin! abo e description.6/tate any assumption# ii# (onstruct an '$ dia!ram and use the relational mappin! rules to deri e a suitable relational schema. 'xplain, why $elational model is more popular than the other two models. (C@E7DE@, &escribe in brief the arious access control policies that are to be determined in li!ht of the security features pro ided by the &%M/. &escribe in brief the reco ery techniques based on immediate update. 'xplain -rd normal form with suitable example. (:E:E3, (onsider the relation $ 6A, %, (, &, ', +, 1# with followin! set of functional dependencies* HA(', '+A&1, %1('+, %+A&, &A%1I i# (ompute the closures of followin! setsJ "."# & ".)# A% ii# +ind a loss less %(,+ decomposition of abo e schema. 5f %(,+ decomposition is not dependency preser in!, find -,+ decomposition. Bhat is concurrency controlK 'xplain with suitable example. (BE10,

b#

b# 7a# b# c# Fa#

b#

A7-R3

P$0" B +4 :

;$n)$#<8 =007

Ga#

b# c#

A schema describin! theatres, cities where they are located and shows is defined as follows* (5TL 6,ame, /tate, (ountry# TH'AT$' 6,ame, (ity, /tate, (apacity# /H4B 6Title, Artist, Hall, Attendance# Brite the followin! queries in both "# SHL and )# R"%$&*+n$% A%0"/#$i) +ind names of artists who performed before at least 7=== people, to!ether with cities where those performances took place. ii# +ind all states in 5ndia where Mr. ? has performed. iii# >ist all artists who ne er played in &elhi. iv) +ind the name of theatres in %ombay whose capacity exceeds 7===. 'xplain in brief A(5& properties of a database transaction. 'xplain the functions of &atabase Administrator. (C=9@DE@E3,

A7-R3

P$0" : +4 :

;$n)$#<8 =007