DOEACC Society 2007 Advanced Level Course In Computer Science A7-R3: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS - Question Paper

A7-R3: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

NOTE:
1. There are 2 PARTS in this Module/paper. PART 1 contains 4 ques. and PART 2 contains 4 ques..

2. PART 1 is to be answered in the TEAR-OFFANSWER SHEET only, attached to the ques. paper, as per the instructions contained therein. PART 1 is NOT to be answered in the ans book.

3. Maximum time allotted for PART 1 is 1 HOUR. ans book for PART 2 will be supplied at the table when the ans sheet for PART 1 is returned. However, candidates who complete PART 1 earlier than 1 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 ONE-40; PART 2 – 60)

PART ONE
(Answer all the questions)

1. Each 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 In AN E-R, Y is the dominant entity and X is a subordinate entity. Then which of the subsequent is incorrect
A) operationally, if Y is deleted, so it X.
B) X existence is dependent on Y.
C) operationally, if X is deleted, so is Y.
D) operationally, if X is deleted, Y remains the identical.

1.2 Assume transaction A holds a share lock R. If a transaction B also requests for a shared lock on R,
A) It will outcome in deadlock situation.
B) It will immediately be granted.
C) It will immediately be rejected.
D) It will be granted as soon as it is releases by A.

1.3 Which of the subsequent is accurate
A) a SQL query automatically eliminates duplicates.
B) SQL permits attribute names to be repeated in the identical relation.
C) a SQL query will not work if there are no indexes on the relations.
D) none of the above.

1.4 Data security threats include
A) private invasion
B) hardware protection
C) fraudulent manipulation of data.
D) all of the above

1.5 A race condition occurs when
A) two concurrent activities interact to reason a processing fault.
B) two users of the DBMS are interacting with various files at the identical time.
C) both A and B
D) none of the above.



1.6 Consider the join of a relation R with a relation S. If R has m tuples and S has n tuples. Then the maximum and minimum size of the join respectively are
A) m+n and 0
B) m+n and |m-n|
C) mn and 0
D) mn and m+n

1.7 In a multiuser database, if 2 users wish to update the identical record at the identical time, they are prevented by doing so by
A) jamming
B) password
C) documentation
D) record-lock

1.8 If every non-key attribute is functionally dependent on the primary key, then the relation will be in
A) 1NF
B) 2NF
C) 3NF
D) 4NF

1.9 R(A,B,C,D) is a relation, Which of the subsequent does not have a lossless join dependency preserving BCNF decomposition

Earning:   Approval pending.