Home / Engineering / Discrete Mathematics MCQs / Page 38

Discrete Mathematics MCQs | Page - 38

Dear candidates you will find MCQ questions of Discrete Mathematics here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

M

Mr. Dubey • 51.43K Points
Coach

Q. 371) The minimum number of edges in a connected graph with n vertices is ___________.

(A) n
(B) n-1
(C) n+1
(D) n+2
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 372) The number of distinct simple graphs with up to three nodes is _________.

(A) 7
(B) 9
(C) 15
(D) 25
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 373) A graph is planar if and only if it does not contain ________.

(A) subgraphs homeomorphic to k3 & k3,3
(B) subgraphs isomorphic to k5 or k3,3
(C) subgraphs isomorphic to k3 & k3,3
(D) sub graphs homeomorphic to k5 or k3,3
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 374) Maximum number of edges in an n-node undirected graph without self loops is ____.

(A) [n(n-a)]/2
(B) n-1
(C) n
(D) [n(n+a)]/2
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 375) Number of distinct nodes in any elementary path of length p is ________.

(A) p
(B) p-1
(C) p+1
(D) p*1
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 376) The total number of edges in a complete graph of n vertices is _________.

(A) n
(B) n/2
(C) [n(n-a)]/3
(D) [n(n-a)]/2
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 377) A directed complete graph of n vertices contains __________.

(A) one arrow between each pair of distinct vertices
(B) two arrows between each pair of distinct vertices
(C) n-1 arrows between each pair of distinct vertices
(D) path between every two distinct vertices
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 378) A directed graph G = (V, E) is said to be finite if its ________.

(A) set V of vertices is finite
(B) set V of vertices & set E of edges are finite
(C) set E of edges are finite
(D) no vertices & edges are repeated
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 379) A state from which a deterministic finite state automata can never come out is called a ____________.

(A) trape state
(B) starting symbol
(C) transition table
(D) transition diagram
View Answer Discuss Share

M

Mr. Dubey • 51.43K Points
Coach

Q. 380) If a compound statement is made up of three simple statements then the number of rows in the truth table is _______.

(A) 2
(B) 4
(C) 6
(D) 8
View Answer Discuss Share