Site icon T4Tutorials.com

Discrete Structure MCQs for Computer Science Students

1. If g and f are two one-to-one functions, then their composition of fog is:

(A) Onto


(B) One to one function


(C) Bijective


(D) None of these



2. If 1=1 then 2=3, the conditional statement is:

(A) False


(B) True


(C) Biconditional


(D) None of the above



3. Which of the following pair is not congruent modulo 7?

(A) 10,32


(B) -21,23


(C) 25,56


(D) None of the above



4. Let A = {1, 2, 3} and R = {(1, 3), (2, 2), (3, 1)} be a relation on A. Is R:

(A) Transitive


(B) Reflexive


(C) Transitive and Reflexive


(D) Symmetric



5. In Boolean addition 1+1 =:

(A) 2


(B) 1


(C) 0


(D) None of the above



6. The simple graph with n vertices, the maximum degree is:

(A) n+1


(B) 2n-1


(C) n


(D) n-1



7. How many vertices does a circle have?

(A) Only 1


(B) 8 vertices


(C) No vertices


(D) None of the above



8. If g(x) = 3x + 2, then gog(x) is:

(A) 6x + 4


(B) 9x + 8


(C) 3x – 2


(D) None of the above



9. The number of distinguishable permutations of the letters in the word BANANA is:

(A) 60


(B) 36


(C) 20


(D) 10



  1. Discrete Mathematics Solved MCQs.
  2. Discrete Mathematics MCQs for Computer Science Students.
  3. Discrete Mathematics MCQs for Software Engineering Students.
  4. Discrete Mathematics MCQs for jobs test and examination.
  5. Discrete Mathematics MCQs.

Discrete Mathematics MCQs

  1. Discrete Mathematics MCQs
  2. Discrete Mathematics MCQs set 2
  3. Discrete Mathematics MCQs SET 3
  4. Discrete Mathematics MCQs SET 4
  5. Discrete Mathematics MCQs SET 5
Computer Science Repeated MCQs Book Download

Exit mobile version