Sie sind auf Seite 1von 4

Question Number 1

Which one of the following is NOT a referential integrity issue in a relational database where the DEPT column of the EMPLOYEE table is designated as a foreign key into the DEP !TMENT table" #$ #$ Deleting a row of DEP !TMENT 2. Inserting a new row into DEPARTMENT with a primary key that is not the a!ue o" the DEPT #o!umn o" any row in EMP$%&EE %$ &'dating the (alue of DEPT in a row of EMPLOYEE with a (alue that is not the 'rimary key of any of the rows in DEP !TMENT )$ *nserting a new row into EMPLOYEE with a DEPT whose (alue is not the 'rimary key of any of the rows in DEP !TMENT

Question Number 2
+, -ousekee'ing .orces are res'onsible for maintaining a building that com'rises of #// floors$ The maintenance com'any decides to use a database to schedule work for its em'loyees and also check the status of the work$ When an assigned housekee'er does NOT re'ort for work0 an alternate resource is allotted to com'lete the 1ob$ The -ousekee'ing database in its current form is gi(en below$ 'ousekeeper -ouse2ee'er*D -ouse2ee'erName -ouse2ee'er33N 3u'er(isor*D (uper isor 3u'er(isor*D 3u'er(isorName 3u'er(isor33N )!oor .loorNo .loorName Transa#tion .loorNo DutyDate -ouse2ee'er*D Work3tatus A!ternateTransa#tion .loorNo

DutyDate lternate-*D lternateWork3t 3elect the o'tion that correctly lists the foreign keys for the different entities$ Note that the entity names are gi(en in bold$ 'ousekeeper 4 3u'er(isor*D 1 Transa#tion 4 -ousekee'er*D A!ternateTransa#tion 4 lternate-*D 'ousekeeper 4 -ousekee'er33N (uper isor 4 3u'er(isor33N 5 Transa#tion 4 -ousekee'er*D A!ternateTransa#tion 4 lternate-*D 'ousekeeper 4 -ousekee'er*D (uper isor 4 3u'er(isor*D % )!oor 4 .loorNo or .loorName Transa#tion 4 .loorNo A!ternateTransa#tion 4 .loorNo 'ousekeeper 4 3u'er(isor*D (uper isor 4 -ousekee'er*D ) Transa#tion 4 -ousekee'er*D A!ternateTransa#tion 4 lternate-*D

Question Number *
Select the option that represents the I in ACID rules.

#$ Each transaction must maintain the integrity constraints of the database 5$ The com'leted transactions cannot be aborted later %$ Either all the statements in a transaction must be e6ecuted0 or none of them should be e6ecuted +. Any two simu!taneous transa#tions #annot obstru#t ea#h other

Question Number +
You ha(e two relation (ariables7 !el8# and !el85$ They are NOT necessarily distinct$ You ha(e a set 2 as a key for !el8#$ ,onsider that .2 is a subset of the heading of !el85 that in(ol(es e6actly the same attributes as 2$
From the following options, select the option that correctly depicts a scenario where FK can e considered as a foreign !ey. ". #$ E(ery tu'le in !el8# has a 2 (alue that is e9ual to the .2 (alue in some tu'le in !el85

5$ 5$ E(ery tu'le in !el85 has a 2 (alue that is e9ual to the .2 (alue in some tu'le in !el8# %$ E(ery tu'le in !el8# has a .2 (alue that is e9ual to the 2 (alue in some tu'le in !el85 +. E ery tup!e in Re!,2 has a )- a!ue that is e.ua! to the - a!ue in some tup!e in Re!,1

Question Number /
Select the option that correctly descri es the data ase replication concept where two or more replicas synchroni#e each other through a transaction identifier.

1. Master0(!a e 5$ Multimaster %$ :uorum )$ Multimastersla(e

Question Number 1
$hich one of the following is %&' guaranteed y transactions in a data ase system(

1. 2hanges ma3e to 3ata 3uring the transa#tion are not isib!e to other pro#esses unti! the transa#tion #omp!etes 5$ ll of the changes made to data during a transaction will be 'ermanently stored in the database %$ *ntegrity constraints defined in the database schema are satisfied once the transaction com'letes )$ While one 'rocess is modifying some data within a transaction0 a second 'rocess must wait until the first com'letes its transaction before making its own modifications to that data

Question Number 4
Select the option that represents the definition of networ! data ase model.

#$ ttem'ts to bring closer interacti(ity between database administrators and a''lication 'rogrammers 5$ Organi;es the data in the form of a tree of records0 with each record ha(ing one 'arent record 5$ and many children records %$ !e'resents the entire information content of the database in only one way +. A!!ows ea#h re#or3 to ha e mu!tip!e parent an3 #hi!3 re#or3s5 thereby "orming a !atti#e stru#ture
".