System Analysis and Design
311. Attributes are
- properties of relationship
- attributed to entities
- properties of members of an entity set
- i
- i and ii
- i and iii
- iii
Correct answer: (C)
i and iii
312. A relation is
- an entity
- a relationship
- members of a relationship set
- members of an entity set or a relationship set
Correct answer: (D)
members of an entity set or a relationship set
313. Normalization is a process of restructuring a relation to
- minimize duplication of data in a database
- maximize duplication of data to ensure reliability
- make it of uniform size
- allow addition of data
Correct answer: (A)
minimize duplication of data in a database
314. A second Normal Form (2 NF) relation should
- be in 1 NF
- not have a composite key
- not have attributes dependent on key attribute
- not have attributes dependent on one another
Correct answer: (A)
be in 1 NF
315. A relationship is
- an item in an application
- a meaningful dependency between entities
- a collection of related entities
- related data
Correct answer: (B)
a meaningful dependency between entities
316. One entity may be
- related to only one other entity
- related to itself
- related to only two other entities
- related to many other entities
Correct answer: (D)
related to many other entities
317. Rows of a relation are called
- tuples
- a relation row
- a data structure
- an entity
Correct answer: (A)
tuples
318. The process of normalization
- is automatic using a computer program
- requires one to understand dependency between attributes
- is manual and requires semantic information
- is finding the key of a relation
Correct answer: (B)
requires one to understand dependency between attributes
319. An attribute y may be functionally dependent on
- a composite attribute x,y
- a single attribute x
- no attribute
- i and ii
- i and iii
- ii and iii
- iii
Correct answer: (A)
i and ii
320. A relation is said to be in 3 NF if
- it is in 2 NF
- non-key attributes are independent of one another
- key attribute is not dependent on part of a composite key
- has no multi-valued dependency
- i and iii
- i and iv
- i and ii
- ii and iv
Correct answer: (C)
i and ii