How To Exam?

a knowledge trading engine...


DOEACC Society 2007 DOEACC A Level A7-R3 Introduction to Data Base Management Systems - Question Paper

Thursday, 13 June 2013 08:25Web
B) Dependency preservation
C) Both A) and B)
D) None of the above
A7-R3 Page two of six January, 2007
2. every statement beneath is either actual or FALSE. select the most improper one
and ENTER in the “tear-off” sheet attached to the ques. paper, subsequent
instructions therein. (1 x 10)
2.1 The referential integrity rule states that every foreign key value must match a key value in
an associated table.
2.2 Relational calculus employs procedural way for stating queries.
2.3 The division operator can be expressed as a sequence of p, X and – operations.
2.4 In a hierarchical database, modeling of many to many relations in achieved by record
replication.
2.5 A foreign key may not have null or partial null values.
2.6 ER diagram functions performed by a system.
2.7 During the process of recovery, every pair of physical blocks is examined.
2.8 Stable storage is implemented by replicating the needed info in several non-volatile
disks with independent failure modes.
2.9 Multi-valued dependency R.A? ?R.B holds in R iff the set of B values matching a provided (A,
C) pair in R depends on both A and C values.
2.102–phase locking protocols ensures freedom from deadlock.
3. Match words and phrases in column X with the nearest related meaning/
word(s)/phrase(s) 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 DDL A. Specified a predicate that must be satisfied by every
tuple in relation
3.2 Normalization B. Authentication
3.3 Outer-join C. Specifies a condition that is not to be Checked
3.4 Check( ) clause in SQL D. Data Dictionary
3.5 Dashed Ellipses in ER
diagram
E. Removes Redundancy
3.6 DBA F. Derived attributes
3.7 Shadow Paging G. Multi-valued attributes
3.8 Relational Algebra H. No-force approach
3.9 Hierarchical model I. Tables
3.10 Deferred Update J. Tree structure
K. No-steal approach
L. Deals with missing info
M. Database made up of fixed size pages
N. Used to declare database schema
O. Procedural
A7-R3 Page three of six January, 2007
4. every statement beneath has a blank space to fit 1 of the word(s) or phrase(s) in
the list beneath. Enter your option in the “tear-off” ans sheet attached to the
ques. paper, subsequent instructions therein. (1 x 10)
A. Tuples B. Acyclic C. Recovery management



( 0 Votes )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER DOEACC Society 2007 DOEACC A Level A7-R3 Introduction to Data Base Management Systems - Question Paper