test 1 review part 6 Flashcards

1
Q

A candidate key is:

A) required to be unique.

B) used to represent rows in relationships.

C) a candidate to be the primary key.

D) Both A and B

E) Both A and C

A

E) Both A and C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

By separating data into tables containing data on only one theme each, making changes to the data is simplified. ( T or F)

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Referential integrity constraints must be enforced by the application program. (T/F)

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Which of the following is true about a relation?

A) The order of the columns in a relation must go from largest to smallest.

B) All entries in any column must be of the same kind.

C) A relation may have duplicate column names.

D) A relation may have duplicate rows.

E) A relation may have multiple names.

A

B) All entries in any column must be of the same kind.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

STUDENT (SID, StudentName, Major, AdvisorID)

ADVISOR (AdvisorID, AdvisorName, Office, Phone)

Given the relations above such that each student is assigned to one advisor, which of the following is true?

A) SID is both a primary key and a foreign key.

B) AdvisorName is a determinant.

C) AdvisorID is a foreign key.

D) Phone is a candidate key.

E) Major is a candidate key.

A

C) AdvisorID is a foreign key.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Identify the determinant and functional dependency ObjectColor —>(Weight, Shape)

A

ObjectColor: Determinant

Functional Dependency: ObjectColor—>(Weight, Shape)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Which of the following functional dependency diagrams accurately represents the following situation:

  • A campus has many buildings.
  • Each building has a unique name.
  • Each building has many rooms.
  • All rooms in any given building are numbered sequentially starting at “101.”
  • Each room has a certain capacity, although many rooms in the same building or different buildings may have the same capacity.
  • Each room is assigned to a single department.
  • A department may have many rooms in one or more buildings, each with the same or different capacities.

A) BuildingName → (RoomNumber, Capacity, Department)

B) RoomNumber → (BuildingName, Department, Capacity)

C) (Department, Capacity) → (BuildingName, RoomNumber)

D) (BuildingName, Capacity) → (Department, RoomNumber)

E) (BuildingName, RoomNumber) → (Capacity, Department)

A

E) (BuildingName, RoomNumber) → (Capacity, Department)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Normalization is the process of removing all functional dependencies from a relation. (T/F)

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly