RELATIONAL DATA BASE MANAGEMENT SYSTEMS
1. A data dictionary is a special file that contains
A) The names of all fields in all files
B) The data types of all fields in all files
C) The widths of all fields in all files
D) None of the above
2. In !" which command is #sed to add a col#mn level inte$rity constraint to the table
A) ADD C%"&'N
B) IN()T C%"&'N
C) '%DI*+ TAB"(
D) A"T() TAB"(
,. A transparent DB'
A) Can not hide sensitive information from the #sers
B) -eep its lo$ical str#ct#re hidden from #sers
C) -eeps its physical str#ct#re hidden from #sers
D) Both B and C
.. /hich normal form is considered ade0#ate for normal relational data base desi$n
A) 2 N* B) 1 N* C) . N* D) , N*
1. /hen several #sers try to access the data base at the same time2 it is said to be
A) Connection Trap
B) Conc#rrent torin$
C) Inte$rated Data
D) Database 'ana$ement
3. #ppose we want to create a linear hash file with a file load factor of 4.5 and a
bloc6in$ factor of 24 records per b#c6et2 which is to contain 1122444 records initially.
7ow many b#c6ets sho#ld we allocate in the primary area8
a) 944 b) 9444 c) 594 d) 5944
5. Consider a dis6 with bloc6 si:e B;112 bytes. A bloc6 pointer is <;3 bytes lon$
and a record pointer is <
)
;5 bytes lon$. The search 6ey field is =;> bytes lon$.
Calc#late ?i) the order @p@ and ?ii) p
leaf
of the B
A
tree.
a) ,.2 ,1 b) ,12 ,1 c) ,.2 ,. d) ,12 ,.
9. /hich two files are #sed d#rin$ operation of the DB'8
a) !#ery lan$#a$e and #tilities.
b) Data manip#lation lan$#a$e and 0#ery lan$#a$e.
c) Data dictionary and transaction lo$.
d) Data dictionary and 0#ery lan$#a$e.
>. The 6ey to a costBeffective data inp#t operation is
a) %C) e0#ipment b) validity chec6s c) =alidation d) employee motivation
14. /hich of the followin$ is not an advanta$e of centrali:e control.
a) )ed#ced red#ndancy b) Avoidance of inconsistency
c) <ipeline operation d) hared data
11. *or a data base relation ) ?a2 b2 c2 d)2 where the domains of a2 b2 c2 d incl#de only
atomic val#es2 only the followin$ f#nctional dependencies and those that can be inferred
from them hold ac bd. The relation is
a) the first normal form b#t not in second normal form
b) in econd normal form b#t not in third normal form
c) in third normal form
d) none of the above
12. "et ) ?a2 b2 c) and ?d2 e2 f) be two relations in which D is the for forei$n 6ey of
that refers to the primary 6ey of ). Consider the followin$ fo#r operations on ) and .
?i) Insert into ) ?ii) Insert into ?iii) Delete from ) ?iv) Delete from
/hich of the followin$ statements is tr#e abo#t the referential inte$rity constraint above
a) None of ?a)2 ?b) or ?d) can ca#se its violation
b) All of the ?a)2 ?b)2 ?c) and ?d) can ca#se its violation
c) Both ?a) and ?d) can ca#se its violation.
d) Both ?b) and ?c) can ca#se its violation.
1,. Name Age Occupation Category
)emain 25 Con A
Divisha ,2 er B
heshbi 2. '#s C
*or the above five records in a data base2 there is an indeC file associated with this
and it contains the val#es 12, and 2 /hich one of the fields is the indeC b#ilt from8
a) A$e b) Name c) %cc#pation d) Cate$ory
1.. Consider the schema ); ?T&=) and the dependencies T2 T&2 &=2
=. "et ) ; ?)1 and )2) be a decomposition s#ch that )1 n )2 ; D. The
decomposition is
a) Not in 2 N* b) In 2 N* b#t not in , N*
c) In , N* b#t not in 2 N* d) In both 2 N* and , N*
11. ('<ED(<(ND(NT ('<NA'( X D(<(ND(NT
ACT&A"ED(<(ND(NT F
N;(N ?('<ED(<(ND(NT)
Is e0#ivalent of
a) ACT&A"ED(<(ND(NT('<NA'(
N;(N
D(<(ND(NT
b) ACT&A"ED(<(ND(NT('<NA'(
N;(N
D(<(ND(NT
c) ACT&A"ED(<(ND(NT('<NA'(
N;(N
D(<(ND(NT
d) ACT&A"ED(<(ND(NT('<NA'(
N;(N
D(<(ND(NT
