This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Boolean Algebra – Prime Implicants and Essentials”. 1. What is the maximum number of prime implicants with 34-variable minimized expression? a) 34 b) 764 c) 233 d) 231 2. How many cells are there for an 8-variable K-Map? a) 421 b) 1048 … Read more
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Boolean Algebra – Interconversion of Gates”. 1. In order to make a luggage security alarm, a single _____ is used. a) NOR gate b) NAND gate c) X-NOR gate d) XOR gate 2. In Boolean algebra, the data is a bit-representation of … Read more
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Boolean Algebra – Karnaugh Maps”. 1. K-map is used for _______ a) logic minimization b) expression maximization c) summing of parity bits d) logic gate creation 2. To display time in railway stations which digital circuit is used? a) seven segment decoder … Read more
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Minimization of Boolean Functions”. 1. Find the simplified expression A’BC’+AC’. a) B b) A+C c) (A+B)C’ d) B’C 2. Evaluate the expression: (X + Z)(X + XZ’) + XY + Y. a) XY+Z’ b) Y+XZ’+Y’Z c) X’Z+Y d) X+Y 3. Simplify the … Read more
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Boolean Functions”. 1. What is the use of Boolean identities? a) Minimizing the Boolean expression b) Maximizing the Boolean expression c) To evaluate a logical identity d) Searching of an algebraic expression 2. _________ is used to implement the Boolean functions. a) … Read more
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Boolean Algebra”. 1. Algebra of logic is termed as ______________ a) Numerical logic b) Boolean algebra c) Arithmetic logic d) Boolean number 2. Boolean algebra can be used ____________ a) For designing of the digital computers b) In building logic symbols c) … Read more
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Spanning Trees”. 1. Spanning trees have a special class of depth-first search trees named _________ a) Euclidean minimum spanning trees b) Tremaux trees c) Complete bipartite graphs d) Decision trees 2. If the weight of an edge e of cycle C in … Read more
This set of Discrete Mathematics Question Paper focuses on “Trees – Interconversion for Prefix Postfix Infix Notations”. 1. Evaluation of expression a/b+c*d-e in postfix notation. a) ab+cd/*-e b) ab/cd*+e- c) abc/+d*-e d) abcd/+*-e 2. Evaluation of 4*5+3/2-9 in prefix notation. a) *45-/32+9 b) *+453/-29 c) -+*45/329 d) *+/45932 3. What is the output of the … Read more
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Tree Traversal”. 1. In preorder traversal of a binary tree the second step is ____________ a) traverse the right subtree b) traverse the left subtree c) traverse right subtree and visit the root d) visit the root 2. An important application of … Read more
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Trees – Cycles”. 1. If two cycle graphs Gm and Gn are joined together with a vertex, the number of spanning trees in the new graph is ______ a) m+n-1 b) m-n c) m*n d) m*n+1 2. For an n-vertex undirected graph, … Read more
