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
Q. The minimum number of edges in a connected graph with n vertices is ___________.
M
Q. The number of distinct simple graphs with up to three nodes is _________.
M
Q. A graph is planar if and only if it does not contain ________.
M
Q. Maximum number of edges in an n-node undirected graph without self loops is ____.
M
Q. Number of distinct nodes in any elementary path of length p is ________.
M
Q. The total number of edges in a complete graph of n vertices is _________.
M
Q. A directed complete graph of n vertices contains __________.
M
Q. A directed graph G = (V, E) is said to be finite if its ________.
M
Q. A state from which a deterministic finite state automata can never come out is called a ____________.
M
Q. If a compound statement is made up of three simple statements then the number of rows in the truth table is _______.
Jump to
Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.
