Discrete Mathematics MCQs [set-8]

176. Every Isomorphic graph must have representation.

A. cyclic

B. adjacency list

C. tree

D. adjacency matrix
o m
.c
Answer: D
te
a
value of n? q M
177. A cycle on n vertices is isomorphic to its complement. What is the

c
A. 5 M
B. 32

C. 17

D. 8

Answer: A

178. A complete n-node graph Kn is planar if and only if

A. n ? 6

B. n2 = n + 1

C. n ? 4

D. n + 3

Answer: C

179. A graph is if and only if it does not contain a subgraph

homeomorphic to k5 or k3,3.

A. bipartite graph

Download more at McqMate.com

 B. planar graph

C. line graph

D. euler subgraph

Answer: B

180. An isomorphism of graphs G and H is a bijection f the vertex sets of G

and H. Such that any two vertices u and v of G are adjacent in G if and only
if

A. f(u) and f(v) are contained in g but not contained in h

o m
.c
B. f(u) and f(v) are adjacent in h
te
C. f(u * v) = f(u) + f(v) d) f(u) = f(u)2 + f(v a
D. 2
q M
Answer: B c
M
181. What is the grade of a planar graph consisting of 8 vertices and 15
edges?

A. 30

B. 15

C. 45 d

D. 106

Answer: A

182. A is a graph with no homomorphism to any proper subgraph.

A. poset

B. core

C. walk

D. trail

Answer: B

Download more at McqMate.com

183. Which of the following algorithm can be used to solve the Hamiltonian
path problem efficiently?

A. branch and bound

B. iterative improvement

C. divide and conquer

D. greedy algorithm

Answer: A

o m
.c
184. The problem of finding a path in a graph that visits every vertex
exactly once is called?
te
a
A. hamiltonian path problem
q M
B. hamiltonian cycle problem c
C. subset sum problem M
D. turnpike reconstruction problem

Answer: A

185. Hamiltonian path problem is

A. np problem

B. n class problem

C. p class problem

D. np complete problem

Answer: D

186. Which of the following problems is similar to that of a Hamiltonian

path problem?

A. knapsack problem

B. closest pair problem

C. travelling salesman problem

Download more at McqMate.com

 D. assignment problem

Answer: C

187. Who formulated the first ever algorithm for solving the Hamiltonian
path problem?

A. martello

B. monte carlo

C. leonard

o m
D. bellman
.c
Answer: A
te
a
q M
188. In what time can the Hamiltonian path problem can be solved using
dynamic programming? c
A. o(n)
M
B. o(n log n)

C. o(n2)

D. o(n2 2n)

Answer: D

189. Who invented the inclusion-exclusion principle to solve the

Hamiltonian path problem?

A. karp

B. leonard adleman

C. andreas bjorklund

D. martello

Answer: C

190. For a graph of degree three, in what time can a Hamiltonian path be
found?

Download more at McqMate.com

 A. o(0.251n)

B. o(0.401n)

C. o(0.167n)

D. o(0.151n)

Answer: A

191. What is the time complexity for finding a Hamiltonian path for a graph
having N vertices (using permutation)?

o m
A. o(n!)
.c
B. o(n! * n)
te
a
C. o(log n)

q M
D. o(n)
c
Answer: B
M
192. How many Hamiltonian paths does the following graph have?

A. 1

B. 2

C. 3

D. 4

Answer: A

193. How many Hamiltonian paths does the following graph have?

A. 1

B. 2

C. 0

D. 3

Answer: C

Download more at McqMate.com

194. If set C is {1, 2, 3, 4} and C – D = ? then set D can be

A. {1, 2, 4, 5}

B. {1, 2, 3}

C. {1, 2, 3, 4, 5}

D. none of the mentioned

Answer: C

o
195. Let C and D be two sets then C – D is equivalent to
m
.c
A. c’ ? d
te
a
B. c‘? d’

q M
C. c ? d’
c
D. none of the mentioned
M
Answer: C

196. For two sets C and D the set (C – D) ? D will be

A. c

B. d

C. ?

D. none of the mentioned

Answer: C

197. Which of the following statement regarding sets is false?

A. a ? a = a

B. a u a = a

C. a – (b ? c) = (a – b) u (a –c)

D. (a u b)’ = a’ u b’

Answer: D

Download more at McqMate.com

198. Let C = {1,2,3,4} and D = {1, 2, 3, 4} then which of the following hold
not true in this case?

A. c – d = d – c

B. c u d = c ? d

C. c ? d = c – d

D. c – d = ?

Answer: C

o m
.c
e
199. Let Universal set U is {1, 2, 3, 4, 5, 6, 7, 8}, (Complement of A) A’ is {2,
t
a
5, 6, 7}, A ? B is {1, 3, 4} then the set B’ will surely have of which of the
element?
q M
A. 8
c
B. 7 M
C. 1

D. 3

Answer: A

200. Let a set be A then A ? ? and A U ? are

A. ?, ?

B. ?, a

C. a, ?

D. none of the mentioned

Answer: B

Download more at McqMate.com

Take Quick Mock/Practice test on this topic HERE

For Discussion / Reporting / Correction of any MCQ please visit discussion page by clicking on
'answer' of respective MCQ.

o m
.c
te
a
q M
c
M

Download more at McqMate.com