# Discrete Mathematics MCQs for Software Engineering Students

## Discrete Mathematics MCQs for Software Engineering Students

**1. The statement ~(~q)=q Describes:**

A. Double negative law

B. Commutative laws

C. implication Laws

D. None of the above

**2. A graph G is called a ….. if it is a connected acyclic graph:**

A. Cyclic graph

B. Tree

C. Regular graph

D. Not graph

**3. An argument is _____ if the conclusion is not true when all the premises are true:**

A. invalid

B. False

C. valid

D. None of the above

**4. The relation { (1,2), (1,3), (3,1), (1,1), (3,3), (3,2), (1,4), (4,2), (3,4)} is: **

A. Reflexive

B. symmetric

C. Transitive

D. None of the above

**5. A ∩ (B U C) = (A ∩ B) U(A ∩ C) is called:**

A. Distributivity of intersection over union

B. Distributivity of union over intersection

C. None of these

D. Distributivity Law

**6. Letters of CHORD taken all at a time can be written in:**

A. 500

B. 120

C. 122

D. 135

**7. If f(x)=3x+1 then its inverse is:**

A. x-1

B. x +2

C. 1/3(x-1)

D. None of the above

**8. The number of ****colours**** required to properly ****colour**** the vertices of every planer graph is:**

A.2

B.3

C.4

D.5

**9. A number of elements in a set is called:**

A. Finite

B. Cardinality

C. Strength

D. None of the above

**10. A partial ordered relation is transitive,Antisymmetric and :**

A. reflexive

B. bisymmetric

C. anti reflexive

D. none of the above

**11. Which of the given statement is correct?**

A. Functions cannot be defined recursively

B. Sets cannot be defined recursively

C. A recursive definition has one part: Base

D. The process of defining an object in terms of smaller versions of itself is called recursion

**12. The empty graph is also known as:**

A.Trivial graph

B. bipartite graph

C. regular graph

D. none of the above