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

A) A?B, B?CD
B) A?B, B?C, C?D
C) AB?C, C?AD
D) A?BCD

1.10 Consider the schema R{S,T,U,V} and the dependencies S?T, T?U, U?V, V?S. Let R={R1, R2} such that R1nR2=F. Then the decomposition is
A) not 2NF but not in 3NF
B) in 2NF but not in 3NF
C) in 3NF but not in 2NF
D) in both 2NF and 3NF























2. Each statement beneath is either actual or FALSE. select the most improper 1 and ENTER in the “tear-off” sheet attached to the ques. paper, subsequent instructions therein. (1 x 10)

2.1 Data items are composed of data elements.
2.2 A record in 3NF is better than a record to 1NF from a relational mathematics point of view.
2.3 Generalized DBMS do not retrieve data to meet routine requests.
2.4 A relation R with schema (x, y) satisfies the FDs x?y, the tuples <1, 2> and <2, 2> can both be in R simultaneously.
2.5 A relational database which is 3NF may still have undesirable data redundancy because there may exists non trival FDs involving prime attributes only on left side.
2.6 Transferring data in blocks from the main memory to the cache memory enables an interleaved main memory unit to operate at its maximum speed.
2.7 There is always decomposition into BCNF that is lossless and dependency preserving.
2.8 The step verb is used to specify the increment in a loop in PL/SQL
2.9 Commit can be fired upto a savepoint.
2.10 B-Tree are for storing data on disk and B+-Tree are for main memory.

3. Match words and phrases in column X with the nearest related meaning/ word(s)/phrases in column Y. Enter your selection in the “tear-off” ans sheet attached to the ques. paper, subsequent instructions therein. (1 x 10)

X Y
3.1 hierarchical database model A. Organization of a database in its entirety
3.2 record B. Major limitation of file management systems
3.3 database administrator C. Contains all the info about elements of data stored in a database
3.4 schema D. In this database model, every record can have more than 1 parent
3.5 transaction log E. Record of all activity that has affected a database during a period of time
3.6 database F. Hierarchical database model
3.7 data redundancy G. Using this approach means that applications software programs can access data from only a single file at a time
3.8 data dictionary H. Specifies exactly how data will be organizes and stored on a storage device for use by the DBMS
3.9 database management system I. Collection of related files

Earning:   Approval pending.