71. A _____ database does not use pointers or physical links, but instead finds related records by examining the contents of fields.
a. Network
b. Hierarchical
c. Relational
d. Object-Oriented
Answer: (c).Relational

72. A compound key
a. is made up a several pieces of information
b. uniquely identifies an item in a list
c. both (a) and (b)
d. is a combination of each unique key
Answer: (c).both (a) and (b)

73. If a piece of data is stored in two places in the database, then
a. storage space is wasted
b. changing the data is one spot will cause data inconsistency
c. it can be more easily accessed
d. both (a) and (b)
Answer: (d).both (a) and (b)

74. A relational database management (RDBM) package manages data in more than one file at once. How does it organize these file? As
a. tables
b. relations
c. tuple
d. both (a) and (b)
Answer: (d).both (a) and (b)

75. When the primary key is null of the new tuple then the constraint violated is
a. null integrity constraint
b. primary integrity constraint
c. secondary integrity constraint
d. entity integrity constraint
Answer: (d).entity integrity constraint

76. In formal relational model, the set of indivisible values is called
a. range
b. domain
c. relation
d. tuple
Answer: (b).domain

77. In relational model terminology, the table is considered as
a. range
b. domain
c. relation
d. tuple
Answer: (c).relation

78. The key which specifies that two different tuples cannot have the same value is classified as
a. super key
b. simple key
c. parallel key
d. conceptual key
Answer: (a).super key

79. The format or data type must be specified for
a. table ender
b. entity domain
c. range
d. domain
Answer: (d).domain

80. In a relation schema, each key of schema having more than one key is classified as
a. candidate key
b. super key
c. simple key
d. parallel key
Answer: (a).candidate key