This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Properties of Tree”. 1. An undirected graph G which is connected and acyclic is called ____________ a) bipartite graph b) cyclic graph c) tree d) forest 2. An n-vertex graph has ______ edges. a) n2 b) n-1 c) n*n d) n*(n+1)/2 3. … Read more
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Graph’s Matrices”. 1. A direct product of a group G possess which of the following characteristics? a) a multiplication of subgroups of G b) a factorization via subgroups of G c) a superset of subgroups of G d) a maximal power set … Read more
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Planarity, Degree and Coloring of Graph”. 1. The chromatic number of a graph is the property of ____________ a) graph coloring b) graph ordering c) group ordering d) group coloring 2. If a graph G is k-colorable and k<n, for any integer … Read more
This set of Discrete Mathematics Objective Questions & Answers focuses on “Different Path in a Graph”. 1. Which algorithm efficiently calculates the single source shortest paths in a Directed Acyclic Graph? a) topological sort b) hash table c) binary search d) radix sort 2. The _______ of a graph G consists of all vertices and … Read more
This set of Discrete Mathematics written test Questions & Answers focuses on “Isomorphism in Graphs”. 1. A graph which has the same number of edges as its complement must have number of vertices congruent to ______ or _______ modulo 4(for integral values of number of edges). a) 6k, 6k-1 b) 4k, 4k+1 c) k, k+2 … Read more
This set of Tricky Discrete Mathematics Questions and Answers focuses on “Complete and Connected Graphs”. 1. A bridge can not be a part of _______ a) a simple cycle b) a tree c) a clique with size ≥ 3 whose every edge is a bridge d) a graph which contains cycles 2. Any subset of … Read more
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Graphs Properties”. 1. In a 7-node directed cyclic graph, the number of Hamiltonian cycle is to be ______ a) 728 b) 450 c) 360 d) 260 2. If each and every vertex in G has degree at most 23 then G can … Read more
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Bipartite Graphs”. 1. The maximum number of edges in a bipartite graph on 14 vertices is ___________ a) 56 b) 14 c) 49 d) 87 2. In a ______ the degree of each and every vertex is equal. a) regular graph b) … Read more
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Graphs – Lattices”. 1. A Poset in which every pair of elements has both a least upper bound and a greatest lower bound is termed as _______ a) sublattice b) lattice c) trail d) walk 2. In the poset (Z+, |) (where … Read more
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Graphs – Hasse Diagrams”. 1. Hasse diagrams are first made by ______ a) A.R. Hasse b) Helmut Hasse c) Dennis Hasse d) T.P. Hasse 2. If a partial order is drawn as a Hasse diagram in which no two edges cross, its … Read more
