DOEACC Society 2006 DOEACC A Level A7-R3 Introduction to Data Base Management Systems ( ) - Question Paper

A7-R3: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS
NOTE:
1. There are 2 PARTS in this Module/Paper. PART 1 contains FOUR
ques. and PART 2 contains 5 ques..
2. PART 1 is to be answered in the TEAR-OFF ans SHEET only,
attached to the ques. paper, as per the instructions contained therein. PART
ONE is NOT to be answered in the ans book.
3. Maximum time allotted for PART 1 is 1 HOUR. ans book for PART
TWO will be supplied at the table when the ans sheet for PART 1 is
returned. However, candidates, who complete PART 1 earlier than one
hour, can collect the ans book for PART 2 immediately after handing
over the ans sheet for PART ONE.
TOTAL TIME: three HOURS TOTAL MARKS: 100
(PART 1 – 40; PART 2 – 60)
PART ONE
(Answer all the questions)
1. every ques. beneath provide a multiple option of answers. select the most
improper 1 and enter in the “tear-off” ans sheet attached to the ques.
paper, subsequent instructions therein. (1 x 10)
1.1 Consider the join of a relation A with a relation B. If A has k tuples and B has r tuples
then the maximum and minimum sizes of the join respectively are
A) k + r and 0
B) r.k and 0
C) r + k and |k-r|
D) r.k and r + k
1.2 Which of the subsequent is not transaction characteristic in SQL?
A) access mode
B) diagnostics size
C) isolation level
D) commit
1.3 Which of the subsequent cannot enhance database system throughput?
A) Database system throughput can be enhanced by locking the smallest sized objects
possible
B) Database system throughput can be enhanced by reducing the time that transaction that
hold locks
C) Database system throughput can be enhanced by reducing the hot spots (frequently
accessed and replaced database objects)
D) Increasing the main memory capacity can enhance database system throughput.
A7-R3 Page one of five July, 2006
1.4 In a relational database a referential integrity constraint is specified with the help of
A) Primary key
B) Consistency key
C) Foreign key
D) None of the above
1.5 The set of attributes X Í Schema(R) is a super key for relation schema R only if
A) For all relations r over R the number of tuples in projection over X of r is the identical as the
number of tuples in r
B) All attributes of X are having non null values
C) All attributes of X are having unique values
D) None of the above
1.6 Consider the relation scheme R(A,B,C,D) where A is candidate key. With no info
about FDs involved, then R is in which normal form?
A) 1st Normal form
B) 2nd normal form
C) BCNF
D) 3rd Normal form
1.7 Object based data models are used in describing the abstraction of the subsequent

Earning:   Approval pending.