Last updated on:September 4th, 2018,

Discrete Mathematics MCQs for Computer Science Students

Discrete Mathematics 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

Answer - Click Here:
B

2. If 1=1 then 2=3, the conditional statement is:
A. False
B. True
C. Biconditional
D. None of the above

Answer - Click Here:
A

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

Answer - Click Here:
C

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

Answer - Click Here:
D

5. Which one of the following statements is correct?
A. Cyclometric complexity for a flow graph G is V(G) = P + 1, where P is the number of predicate nodes contained in the flow graph G.
B. Cyclometric complexity for a flow graph G is V(G) = N–E+2, where E is the number of edges and N is the number of nodes in the flow graph.
C. The number of regions is not corresponds to the cyclomatic complexity
D. None of the above

Answer - Click Here:
A

6. In Boolean addition 1+1=:
A. 2
B. 1
C. 0
D. None of the above

Answer - Click Here:
B

7. The simple graph with n vertices the maximum degree is:
A. n+1
B. 2n-1
C. n
D. n-1

Answer - Click Here:
D

8. The sequence of 4,1,-2,… is -77 is:
A. 29
B. 26
C. 28
D. none of the above

Answer - Click Here:
B

9. How many vertices of circle has:
A. only 1
B. 8 vertices
C. No vertices
D. none of the above

Answer - Click Here:
C

10. g(x)= 3x+2 then gog(x) :
A. 6x+4
B. 9x+8
C. 3x-2
D. None of the above

Answer - Click Here:
B

11. A graph is tree if and only if :
A. Is planar
B. Contains a circuit
C. Is minimally
D. Is completely connected

Answer - Click Here:
C

12. The number of distinguishable permutations of the letters in the word BANANA are: 
A. 60
B. 36
C. 20
D. 10

Answer - Click Here:
A

0Shares

Leave a Reply

Your email address will not be published.