Moulding
Moulding
Moulding
Application Programmers
7. A collection of concepts that can be used to describe the structure of a
database
Database
DBMS
Data model
Data
8. SDL is
Standard Definition Language
Storage Definition Language
None of the above
9. The ability to modify the physical scheme without causing application
programs to be rewritten is in
a. Physical Data Independence
b. Logical Data Independence
c. None of these
1.
4.
a.
b.
c.
d.
This graphics
indicates that there is a missing entity
indicates that students attend courses
indicates that many students can attend many courses
indicates that students have to attend more than one course
8.
a. many relations, one for each of the distinct values of the attribute
b. one relation that contains a foreign key and a column for the
attribute
c. a column in the relation that represents the entity E
d. none of the above
13. A weak entity type
a. must have total participation in an identifying relationship
b. does not have a key attribute(s)
c. both (a) and (b)
d. none of the above
14. Mapping specialization/generalization entities to the relational model by
creating a relation for each subclass that contains the attributes of that subclass
and all of the attributes of the superclass (i.e., without having a relation for the
superclass) works well if
a. the subclasses are disjoint and there is total participation
b. the subclasses overlap and there is total participation
c. the subclasses are disjoint and there is partial participation
d. the subclasses overlap and there is partial participation
15. Desirable properties of relational database design include
a. minimizing insertion/deletion anomalies
b. minimizing redundancy
c. minimizing update anomalies
d. all of the above
16. A Many-to-Many relationship from an ER diagram can be represented in the
relational model by a
a. domain
b. primary key
c. relation with two foreign keys
d. a single attribute
17. The functional dependency A -> B for relation schema R(A,B,C,D) implies
that
a. no two tuples in R can have the same value for attribute B
b. no two tuples in R can have the same value for attribute A
c. any two tuples in R that have the same value for B must have the same
value for A
d. any two tuples in R that have the same value for A must have the
same value for B
18. If AB -> CD is one of the functional dependencies for relation schema
R(A,B,C,D) then which of the following will always hold?
a. AB is a candidate key for R
b. no two tuples in R can have the same values for A and B
c. AB is a primary key for R
d. all of the above
19. An Entity from an ER diagram can be represented in the relational model by
a
a. domain
b. functional dependency
c. relation
d. a single attribute
20. Given the functional dependencies {AB -> C, C -> D} for the relation schema
R(ABCD), the dependency A -> D can be inferred by
a. the reflexive rule
b. the augmentation rule
c. the transitve rule
d. none of the above
21. Given the functional dependencies, {AB -> CDE and A -> E}, for relation
scheme R = (A,B,C,D,E) we can infer the following:
a. A is a key for R
b. BE is a key for R
c. AB is a key for R
d. none of the above
3. A one to many relationship (of table A to Table B) is
a. Where each record in Table B is required to have a match in table A
b. Where each record in table B can have one or more matching records in
table A
c. Where each record in table A can have one or more matching records
in table B
d. Where each record in table A is required to have a match in table B
4. Assume that Table A is joined to Table B. A one to one join (an inner join or
equijoin)
a. displays all rows (records) for table A and only those in table B that have a
matching value
b. displays rows (records) only when the values of the Key in table A
and the foreign key in table B are equal
c. displays all rows (records) for table B and only those in table A that have a
matching value
d. is when table B contains only one matching record for each key in table A
5. A many to many relationship (join)
a. is a way of joining two tables
b. is use only when all of the tables is in third normal form
c. is a way of joining three tables
d. is not allowed in a practical implementation of a relational design
6. The model for a relational database was first proposed in the
a. 1980
b. 1970
c. 1990
d. 1960
7. In relational algebra the INTERSECTION of two sets (set A and Set B). This
corresponds to
a. A OR B
b. A + B
c. A AND B
d. A - B
8. In relational algebra the UNION of two sets (set A and Set B). This
corresponds to
a. A OR B
b. A + B
c. A AND B
d. A - B
9. The set of rules that govern the internal validity and consistancy of data within
a relational database are known as
a. rules of referential integration
b. rules of data integration
c. rules of data integrity
d. rules of referential integrity
10. A table (relation)
a. orders records by the first field (attribute) in a record
b. does not define a logical order of records (tuples)
c. orders records by the key field in a record
d. imposes a logical order on the records
11. In strict relational terminology, an attribute
a. an entity
b. a field
c. a record
d. a table
12. The process of combining two tables in a relational database is known as
a. a Join
b. a Combine
c. a Relate
d. a Construct
13. The DIFFERENCE between two sets (set A and set B) is defined as all
members of set A but not set B. The notation for this
a. B - A
b. B + A
c. A + B
d. A B
1. The rule that prohibits transitive dependencies is
a. second normal form
b. first normal form
c. third normal form
d. none of the above
2. Consider the table (Relation) CARS. The key is REGNO (car registration
number), OID is a foreign key that identifies the car's owner.
REGNO
(Key
Field)
MODEL
COLOUR
OID
This table is
a. third normal form
b. second normal form
c. first normal form
d. cannot be determined
3. Most RDB designers will accept that in order to deal with the complexities of
"real life" transactions, a design needs to reach
a. second normal form
b. third normal form
c. the standard of a flat file
d. first normal form
4. Consider the table (Relation) STUDREC
SREF
(Key
Field)
INIT
SNAME
DOB
GENDER
RES
KIDS
HTOWN
DISTANCE
a. ensure that there are no dependencies between keys and foreign keys
b. ensure that the database conatins three tables
c. ensure that there are no transitional dependencies, i.e. to ensure that
there are no dependancies between non-key fields
d. ensure that a table that is in second normal form is decomposed into two
or more tables
10. Normalisation is http://vustudents.ning.com
a. a process whereby the design of a table (relation) is decomposed
into more tables that more precisely fit the relational model
b. the process of ensuring that a relational database has at least two tables
in it
c. a process whereby a limit is put on the number of fields a record can
contain
d. the process of ensuring that each table has a key