BCS Discrete Mathematics 3

Question 1

Which of the following statements about trees in graph theory is true?

Accepted Answer

A tree with n vertices has n-1 edges

Answer

A tree with n vertices has n edges

Answer

A tree must have at least one cycle

Answer

All trees are bipartite only if they have even vertices

Question 2

What is 17 mod 5?

Accepted Answer

2

Answer

1

Answer

3

Answer

4

Question 3

Which of the following correctly expresses De Morgan's law for sets?

Accepted Answer

(A ∪ B)' = A' ∩ B'

Answer

(A ∪ B)' = A' ∪ B'

Answer

(A ∩ B)' = A' ∩ B'

Answer

(A ∩ B)' = A ∪ B

Question 4

In how many ways can a committee of 3 be chosen from a group of 7 people?

Accepted Answer

35

Answer

21

Answer

42

Answer

210

Question 5

Which quantifier asserts that a property holds for all elements in the domain?

Accepted Answer

Universal quantifier (∀)

Answer

Existential quantifier (∃)

Answer

Unique quantifier (∃!)

Answer

Bounded quantifier

Question 6

A relation that is reflexive, antisymmetric, and transitive is called a:

Accepted Answer

Partial order

Answer

Equivalence relation

Answer

Total order

Answer

Bijective relation

Question 7

What is the chromatic number of a cycle graph C_5 (a cycle with 5 vertices)?

Accepted Answer

3

Answer

1

Answer

2

Answer

4