Discrete Mathematics Questions and Answers - Boolean Algebra « Prev Next » 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 A View Answer Answer: c Explanation: The variables that can have two discrete values False(0) and True(1) and the operations of logical significance are dealt with Boolean algebra.2. Boolean algebra can be used a) For designing of the digital computers b) In building logic symbols c) Circuit theory d) Building algebraic functions A View Answer Answer: a Explanation: For designing digital computers and building different electronic circuits boolean algebra is accepted widely.3. What is the definition of Boolean functions? a) An arithmetic function with k degrees such that f:¥->Y* b) A special mathematical function with n degrees such that f:Y"->Y c) An algebraic function with n degrees such that f:X"->X d) A polynomial function with k degrees such that f:x2->x" “ View Answer Answer: b Explanation: A Boolean function is a special mathematical function with n degrees and where Y = {0,1} is the Boolean domain with being a non-negative integer. It helps in describing the way in which the Boolean output is derived from Boolean inputs.4. F(X,Y,Z,M) = X°Y°Z°M°. The degree of the function is a)2 b)5 c)4 d)1 I View Answer Answer: ¢ Explanation: This is a function of degree 4 from the set of ordered pairs of Boolean variables to the set {0,1}. 5. A value is represented by a Boolean expression. a) Positive b) Recursive c) Negative d) Boolean * View Answer Answer: d Explanation: A Boolean value is given by a Boolean expression which is formed combining Boolean variables and lo connectives.6. Which of the following is a Simplification law? a) M.(~M+N) = M.N b) M+(N.O) = (M+N)(M+0) c) ~(M+N) = ~M.~N d) M.(N.O) = (M.N).O A View Answer Answer: a Explanation: By Simplification Law we can have X.(~X+Y) = X.Y and X+(~X.Y) = X+Y. By, De’ Morgan's law ~(X+Y) = ~X.~Y. By commutative law we can say that A.(B.C) = (A.B).C. 7. What are the canonical forms of Boolean Expressions? a) OR and XOR b) NOR and XNOR c) MAX and MIN d) SOM and POM * View Answer Answer: d Explanation: There are two kinds canonical forms for a Boolean cores 1)sum of minterms(SOM) form and 2)product of maxterms(SOM) form.8. Which of the following is/are the universal logic gates? a) OR and NOR b) AND c) NAND and NOR d) NOT I View Answer Answer: c Explanation: NAND and NOR gates are known as the universal logic gates. A universal gate is a gate which can implement any Boolean function without the help of 3 basic gate types. 9. The logic gate that provides high output for same inputs a) NOT b) X-NOR c) AND d) XOR * View Answer Answer: b Explanation: The logic gate which gives high output for the same inputs, other low output is known as X-NOR or Exclu NOR gate.10. The of all the variables in direct or complemented from is a maxterm. a) addition b) product c) moduler d) subtraction A view Answer Answer: a Explanation: The Boolean function is expressed as a sum of the 1-minterms and the inverse of function is represented as 0- minterms.Discrete Mathematics Questions and Answers - Boolean Functions « Prev Next » 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 * View Answer Answer: a Explanation: Boolean identities are used for minimizing the Boolean expression and transforming into an equivalent expression.2. is used to implement the Boolean functions. a) Logical notations b) Arithmetic logics c) Logic gates d) Expressions View Answer Answer: c Explanation: To implement a Boolean function logic gates are used. Basic logic gates are AND, OR and NOT. 3. Inversion of single bit input to a single bit output using a) NOT gate b) NOR gate c) AND gate d) NAND gate View Answer Answer: a Explanation: A NOT gate is used to inve single bit input (say A) to a single bi output (~A).4. There are numbers of Boolean functions of degree n. a)n b) 202) on? d) nin*2) View Answer Answer: b Explanation: There are 2n different n- tuples of 0's and 1's. A Boolean function is an assignment of 0's or 1's to each of these 2 n different n-tuples. Hence, there are 2*") different Boolean functions. S.A is a Boolean variable. a) Literal b) String c) Keyword d) Identifier * View Answer Answer: a Explanation: A literal is a Boolean variable or its complement. A maxterm is a su n literals and a minterm is a product literals.6. Minimization of function F(A,B,C) = A*B* (B+C) is a) AC b) B+C c)B° d) AB A View Answer Answer: d Explanation: AB(B+C) = ABB + ABC [Applying distributive rule] = AB + ABC [Applying Idempotent law] = AB (1+C) = AB*1 [As, 1+C=1] = AB.7. The set for which the Boolean function is functionally complete is a) {*, %, /} b) {., +, -} c) {*, +, -} d) {%, +, *} View Answer Answer: b Explanation: A Boolean function is represented by using three operators ., +, -. We can find a smaller set of functionally complete operators if one of the three operators of this set can be expressed in terms of the other two.8. (X+Y°)(X+Z) can be represented by a) (X+Y°Z) b) (Y+X*) c) XY° d) (X+Z*) View Answer Answer: a Explanation: (X+Y °) (X+Z) =XX+XZ+ XY + YZ =X+XZ+XY°+Y°Z =X (14+Z)+XY°+Y°Z =X.14+XY°+Y°Z =X(14Y¥°)+Y°Z =X+Y°Z.9. is a disjunctive normal form. a) product-of-sums b) product-of-subtractions c) sum-of-products d) sum-of-subtractions “ View Answer Answer: c Explanation: The sum of minterms that represents the function is called the sum- of-products expansion or the disjunctive normal form. A Boolean sum of minterms has the value 1 when exactly one of the minterms in the sum has the value 1. It has the value O for all other combinations of values of the variables.10.aSb= a) (a+b)(a*+b~) b) (a+b *) c)b° dja’ +b° View Answer Answer: a Explanation: a ® b =a’ b+ab° =a b+aa’ + bb° + ab* [As, a*a* = 0 and b*b* = 0] = a‘(atb) + b (a+b) =(at+b}(a>+b°),Discrete Mathematics Questions and Answers - Minimization of Boolean Functions « Prev Next » 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) BC View Answer Answer: C Explanation: Given: A’BC’ + AC’ =C(A'B +A) =C(A+ B).2. Evaluate the expression: (X + Z)(X + XZ’) + XY +Y. a) XY+Z’ b) Y+XZ'+Y'Z c) X'Z+¥ d) X+¥ “ view Answer Answer: d Explanation: (X + Z)(X + XZ’) + XY + Y [Original Expression] = (x + 2)X(1 + Z') + XY + Y [Distributive] = (X + Z)X + XY + ¥ [Complement, Identity] = (X+Z)X + Y(X+1) [ Distributive] = (X+Z)X + Y [I[dempotent] = XX + XZ + Y [Distributive] =X+ XZ + Y [Identity] =X(1+Z)+Y =X + Y [Idempotent].3. Simplify the expression: A(A + BC) + (AC + B’C). a) (AB'C+BC’) b) (A’B+C’) c) (A+ BC) d) AC I View Answer Answer: b Explanation: Given: AA + BC) + (AC + B'C) =AA+ABC+AC+B'C = A'BC + C(A + B) =C(AB+A+ B) =C(A+B+ B) =C(A+1) = AC.4. What is the simplification value of MN(M + N’) + M(N + N'Y)? a)M b) MN+M’N’ c) (1+M) d) M+N’ * View Answer Answer: b Explanation: Given: MN(M + N’') + M(N +N’) = MN(M+N’) + M.1 =MNM + MNN’+M =MN+0+M = M(N + 1) =M. 5. Simplify the expression XZ' + (Y + Y'Z) + XY. a) (1+XY’) b) YZ +XY'+Z’ c) (X+Y +2) d) XY'+Z’ * View Answer Answer: ¢ Explanation: Given: X Z' + (Y + Y’Z) + XY =XZ'+(¥ +Z)+XY =XZ’'+Y+Z+XY = (XZ' + Z) + (Y + XY) =(X+Z)+Y(1 +X) =X+Y+Z.6. Find the simplified term Y’ (X' + Y’) (X + XY)? a) XY’ b) XY c)X+Y d) X’'Y’ I View Answer Answer: a Explanation: Given: Y’ (X’ + Y’) (X + XY) =Y(X + YX + Y) = (X'Y' + Y')(X + Y) = (XX'Y' + XY'Y + XY’ + YY’) = XY’. 7. \f an expression is given that x+x’y'Z=x+y'Z, find the minimal expression of the function F(X, y,Z) = x+x'yz+yz? ajy +z b)xz+y’ c)x+z d)x +y * View Answer Answer: ¢ Explanation: We have, x+x’y'z+yz = x+yztyz [since, x+x'yZ=x+yZ] = xtz(y'ty) =X+Z,8. Simplify the expression: XY’ + X' + Y'X’. a)X'+Y b) XY’ c) (XYY’ d) Y'+X (* View Answer Answer: c Explanation: Given XY'+X'+Y'X' = Y'(X+X’) + X’ =Y'.1 +X'=X'+ Y' = (xY)' [De Morgan’s law]. 9. Minimize the Boolean expression using Boolean identities: A'B+ABC'+BC'+AB'C'. a) B(AC)' + AC’ b) AC’ + B’ c) ABC +B’+C d) BC’ +A‘B (* View Answer Answer: a Explanation: Given: A'B+ABC'+BC'+AB'C' = A'B + BC (1 +A) + ABC” =A’B+BC'+ABC =AB+BC +BC'+ABC = B(A’+ C) + C(A + AB) = B(AC)' + C’A(1 + B) = B(AC)' + AC’.10. Minimize the following Boolean expression using Boolean identities. F(A,B,C) = (A+BC’)(AB’+C) ayA+B+C b) AC’ +B c)B+AC d) A(B’ + C) View Answer Answer: d Explanation: Given, F(A,B,C) = (A+BC’) (AB‘+C) = (AAB' + BC'AB’ + AC + BC’C) = (AB'+0+AC +0) = A(B' + C).Questions and Answers - Boolean Algebra - Karnaugh Maps « Prev Next » 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 * View Answer Answer: a Explanation: K-map(Maurice Karnaugh of Bell labs in 1953) is defined as a diagrammatic method for logic minimization and it is a pictorial view of truth table which shows the relationship between inputs and output. It is more efficient than Boolean algebra. K-map is a diagram made up of squares in which each square represents a minterm or maxterm of the logic function.2. To display time in railway stations which digital circuit is used? a) seven segment decoder b) eight segment encoder c) 8:3 multiplexer d) 9 bit segment driver A view Answer Answer: a Explanation: A seven segment decoder is a digital circuit which is used to construct a common type of digital display device i.e., a set of LED (or LCD) segments that display numbers from 0O through 9 at the command of a four-bit code. Moreover, the behavior of the display driver IC is represented by a truth table with seven outputs.3. Simplify the expression using K-maps: F(A,B,C,D)=2 (1,3,5,6,7,11,13,14). a) AB+BC'D+A'B'C b) BCD’+A’C’D+BD’ c) A'D+BCD+A'BC+AB'C’ d) AC'D'+BC+A’BD+C’D’ “ View Answer Answer: c Explanation: By solving the — given expression we have minterms such as A'D+BCD+A‘BC+AB’C’. So, we can get the required expression A’D+BCD+A’BC+AB'C’.4. When designing a circuit to emulate a truth table, both Product-of-Sums (POS) expressions and Sum-of-Products (SOP) expressions can be derived from? a) k-map b) NAND gate c) NOR gate d) X-NOR gate A View Answer Answer: a Explanation: A Karnaugh map can be used to build the appropriate POS expression for designing a circuit to form the truth table. Karnaugh maps are not limited to SOP expressions only for minimizing boolean functions.5. Simplify the expression using K-maps: F(A,B,C) = & (1,3,5,6,7). a) AC'+B’ b) AB+C c) AB'+B’'C’ d) A’BC+B’C+AC “A View Answer Answer: b Explanation: By solving the © given expression, the minterms are: C and AB. Hence, we can get the required expression C+AB.6. Simplify the expression using K-maps: F(A,B,C) = 11(0,2,4,5,7). a) (X+Y)(y+Z)(K+Z)(X'+Z') b) (x+z’(y+z)(x+y) C) (X+Y’+Z)(x+z’) q) (y'+z’)(x’+y)(z+y’) * View Answer Answer: a Explanation: By solving the given expression, the maxterms are: (x+y), (x'+y), (x+z) and (x’+z’). Hence, we can get required expression (x+y)(x'+y)(X+Z)(x'+z’). 7. Addition of two or more bits produces how many bits to construct a logic gate? a) 108 b) 2 c) 32 d) 64 * View Answer Answer: b Explanation: Addition of bits requires carry- in and carry-out bits. Addition of two terms (bits) a and b, and a carry-in bit Cin is required to compute a sum bit S ang carry-out bit Cout. Hence, two bits produced in general.8. Use Karnaugh map to find the simplified expression of the function: F = x’yz + xy + xy'z’. a) xz'+y’z' b) xy’z+xy Cc) y'z+x'y+z d) yz+xy+xy'z I View Answer Answer: d Explanation: F = x'yz + xyz + xy z’ + xyz’ is the canonical form for the function. Now, using k-map the minimal form must be: yz+xy+xy’Z. 9. Who has invented K-map? a) Maurice Karnaugh b) Edward Veitch c) George Boole d) Adam Smith View Answer Answer: a Explanation: The Karnaugh map (KM or K- map) is invented by Maurice Karnaugh in 1953 that is a method of simplifyin Boolean expressions. (Ea10. In Gray coding, the adjacent code values differ by a) single bit b) 3 bits c) 10 bits d) 0 bit f* View Answer Answer: a Explanation: In Gray coding, the adjacent code values differ only by a single bit. If the given code-word is 01, then the previous and the next code-words are to be 11 or 00 but cannot be 10 in any case. Each cell within a K-map has a definite place-value which is obtained by using this encoding technique. The rows and the columns of the table use Gray code-labeling which in turn represents the values of the corresponding input variables and each K- map cell can be addressed using a unique Gray Code-Word.Answers - Boolean Algebra - interconversion of Gates « Prev Next » 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, asingle__is used. a) NOR gate b) NAND gate c) X-NOR gate d) XOR gate * View Answer Answer: b Explanation: The NAND gate consists of two inputs and if both of them are high the output is low. A luggage security alarm circuit is a system which is based on the NAND gate. It is used to generate an alarm when any authorized person tries to steal the luggage.2. In Boolean algebra, the data is a_ bit- representation of information consists of a)Oand 1 b)2and5 c)1and15 d)4and8 “ View Answer Answer: a Explanation: The data, in boolean algebra must be in a bit-representation form which can be in between two values 0 and 1. 3. Using which component a shift register is implemented? a) register b) transistor c) latch d) flip-flop A View Answer Answer: d Explanation: A shift register, in digital circuitry, is a combination of two or more flip-flops to share the bits of information by using the same clock. A shift reester have both parallel and serial inputs d outputs.4, How many NAND gates are required to make an XOR gate? a)7 b) 12 c)4 d)8 I View Answer Answer: c Explanation: An XOR gate is created by using four NAND gates. This construction gives a propagation delay three times to that of a single NAND gate. 5. In Multiplexer gate, for selecting the inputs, two bits named sand _____ are required generally. a) selector bit, data bit b) parity bit. Generator bit c) input bit, inverted bit d) raising bit, sinking bit * View Answer Answer: a Explanation: In multiplexer gate for selecting the inputs say, for 3 input bj one bit is required as selector bit and other bits are required as data bits.6.A NOR gate can be derived from a) NAND gate b) XOR gate c) AND gate d) OR gate * View Answer Answer: a Explanation: NAND and NOR gates are called universal gates. As we can generate any of the basic gates as well as other gates from these two gates. So, a NOR gate can be made by a NAND gate. 7. In which logic gate the output state is usually the complement of the input state? a) NOT gate b) NOR gate c) X-NOR gate d) OR gate * View Answer Answer: a Explanation: NOT gate is the simplest digital logic circuit which is also called an inverter because it takes the input in 0 or 1 form and gives the output as complement of the input. io8. In OR gate for 13 numbers of inputs what are the stages possible for it? a) 1239 b) 213 c) 13 d) 1387 * View Answer Answer: b Explanation: OR gate works in a way such that if any of the input is binary low(or 0), the output of the gate is binary 1(or high). Here, the number of stage possible = 2" = 2)3, 9. Which of the following is built exclusively from NOR gate? a) Plant guard machine b) Apollo Guidance Computer c) Street market app d) Dish washer I View Answer Answer: b Explanation: The first embedded system is the Apollo Guidance Computer which was built exclusively from NOR gates. A “eB inverted OR gate is a NOR gate and it have two or more inputs.10. Which of the following gates is used to implement a logical conditional? a) OR gate b) Magnetic logic gate c) XOR gate d) IMPLY gate A View Answer Answer: d Explanation: The IMPLY gate is a digital logic gate that is used to implements logical conditional. Two symbols are used to represent the IMPLY gates — the traditional symbol and the IEEE symbol. IMPLY gate can be made by two memristors.Questions and Answers - Boolean Algebra - Prime Implicants and Essentials « Prev Next » 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 o) 233 d) 231 I View Answer Answer: ¢ Explanation: For n-variable K Map, we have = 2™1 prime implicants. In this case, n=34 and the maximum number of prime implicants will be 2341 = 233,2. How many cells are there for an 8-variable K-Map? a) 421 b) 1048 c) 256 d) 375 A view Answer Answer: Cc Explanation: Any Boolean expression or a function comprising of 8 variables can be solved using an 8-variable K-Map. So, an 8- variable K-Map must contain 28 = 256.3. Determine the number of essential prime implicants of the function f(a, b, c, d) = Zm(1, 3, 4, 8, 10, 13) + d(2, 5, 7, 12), where m denote the minterm and d denotes the don’t care condition. a) 2? b)3 c) 643 d) 128 View Answer Answer: b Explanation: A prime implicant that cannot be replaced by any other implicant for getting the output is called the essential prime implicants, Here, we have 3 essential prime implicants by using the K-map representation.4. How many number of prime implicants are there in the expression F(x, y, Zz) = y’z' + xy + X'Z. a)7 b) 19 3 d) 53 * View Answer Answer: ¢ Explanation: An implicant of a function is a product term which is included in the function. Hence, for the given function, yz’, xy and x’z all are prime implicants. 5. f(x, y, Z) = xy'+yz'+xyz, what are essential prime implicants of this switching function? a)8 b) 0 4 d)3 * View Answer Answer: b Explanation: There are no essential prime implicants for this switching function. BB can get this solution by using K-Map.6. How many essential prime implicants are there in the K-Map of the function F = X(0, 1, 2,4, 7,11, 12, 13, 15)? a)4 b) 1 3 d)7 * View Answer Answer: b Explanation: By, solving the minimization expression using K-Map, there is only 1 essential prime implicant exist as it is not covered by any other input variable. 7. Determine the number of prime implicants of the following function F? F(a, b, c, d) = £m(1, 3, 7, 9, 10, 11, 13, 15) a) 621 b) 187 c) 3° dys I View Answer Answer: d Explanation: There are 5 prime implicants for the function (atb+d'\(a+c'+d’) (a’+c+d)(a'+b+d')(a’+b’+c’+d). Hence, required answer is 5.8. For an 18-variable k-map determine the number of prime implicants? a) 218 b) 35 c) 253 d) 721 View Answer Answer: a Explanation: The maximum number of implicants for the n-variable k-map is 2". Hence, the required answer is 218, 9. How many false essential prime implicants for the given Boolean functions f(A, B, C) = >m(2, 5, 6)? a) 1024 b)2 c) 16 d) 435 A View Answer Answer: b Explanation: There are two essential prime implicants such as (B+C) and (B+C’) for the given function. Hence, the required answer is 2. n10. How many minimal forms are there in the function F(A, B, C) = 3(1, 3, 2, 5, 6, 7) if it is having cyclic prime implicants k-map? a) 216 b)2 c) 14 d) 82 “ View Answer Answer: b Explanation: In cyclic prime implicant, min terms will be (1, 3, 5, 7, 9, 11). Hence, either we can have [(1,3), (7,11), (5,9)] or [(1,5), (11,9), (3.7)]. So, there can be 2 minimal forms.Discrete Mathematics Questions and Answers - Graphs - Lattices « Prev Next » 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 * View Answer Answer: b Explanation: A poset in which every pair of elements has both a least upper bound and a greatest lower bound is called a lattice. A lattice can contain sublattices which are subsets of that lattice.2. In the poset (Z*, |) (where Z’ is the set of all positive integers and | is the divides relation) are the integers 9 and 351 comparable? a) comparable b) not comparable c) comparable but not determined d) determined but not comparable * View Answer Answer: a Explanation: The two integers 9 and 351 are comparable since 9|351 i.e, 9 divides 351. But 5 and 127 are not comparable since 5 | 127 i.e 5 does not divide 127. 3. If every two elements of a poset are comparable then the poset is called a) sub ordered poset b) totally ordered poset c) sub lattice d) semigroup * View Answer Answer: b Explanation: A poset (P, <=) is known as totally ordered if every two elements of the poset are comparable. “<=” is called a 8g order and a totally ordered set is qd termed as a chain.4. and are the two binary operations defined for lattices. a) Join, meet b) Addition, subtraction c) Union, intersection d) Multiplication, modulo division A View Answer Answer: a Explanation: Join and meet are the binary operations reserved for lattices, The join of two elements is their least upper bound. It is denoted by V, not to be confused with disjunction. The meet of two elements is their greatest lower bound. It is denoted by A and not to be confused with a conjunction.5.A has a greatest element and a least element which satisfy 0<=a<=1 for every a in the lattice(say, L). a) semilattice b) join semilattice c) meet semilattice d) bounded lattice view Answer Answer: d Explanation: A lattice that has additionally a supremum element and an_ infimum element which satisfy 0<=a<=1, for every an in the lattice is called a bounded lattice. A partially ordered set is a bounded lattice if and only if every finite set (including the empty set) of elements has a join and a meet.6. The graph given below is an example of a) non-lattice poset b) semilattice c) partial lattice d) bounded lattice * View Answer Answer: a Explanation: The graph is an example of non-lattice poset where b and c have common upper bounds d, e and f but none of them is the least upper bound.7. A sublattice(say, S) of a lattice(say, L) is a convex sublattice of L if a) x>=z, where x in S implies z in S, for every element x, yin L b) x=y and y<=z, where x, y in S implies z in S, for every element x, y, Zin L c) x<=y<=z, where x, y in S implies z in S, for every element x, y, Zin L d) x=y and y>=z, where x, y in S implies z in S, for every element x, y, Zin L A View Answer Answer: c Explanation: A sublattice S of a lattice Lisa convex sublattice of L, ifxmodular identity: (a A c) V (b A c) = [(a Ac) V b] Ac. This condition is equivalent to the following axiom -> modular law: a< c implies a V (b Ac) =(aV b) Ac. A lattice is modular if and only if it does not have a sublattice isomorphic to Ns. _9. Every poset that is a complete semilattice must always bea a) sublattice b) complete lattice c) free lattice d) partial lattice A view Answer Answer: b Explanation: A poset is called a complete lattice if all its subsets have both a join and a meet. Every complete lattice is a bounded lattice. Every poset that is a complete semilattice must always be a complete lattice.10. A free semilattice has the property. a) intersection b) commutative and associative c) identity d) universal “ View Answer Answer: d Explanation: Any set X may be used to generate the free semilattice FX. The free semilattice is defined to consist of all of the finite subsets of X with the semilattice operation given by ordinary set union; the free semilattice has the universal property.Discrete Mathematics Questions and Answers - Graphs - Hasse Diagrams « Prev Next » 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 A View Answer Answer: b Explanation: Hasse diagrams can be described as the transitive reduction as an abstract directed acyclic graph. This graph drawing techniques are constructed by Helmut Hasse(1948).2. If a partial order is drawn as a Hasse diagram in which no two edges cross, its covering graphis called a) upward planar b) downward planar c) lattice d) biconnected components A View Answer Answer: a Explanation: In a Hasse diagram if no two edges cross each other in the drawing of partial order Hasse diagram, then its covering graph called the upward planar.3. If the partial order of a set has at most one minimal element, then to test whether it has a non-crossing Hasse diagram its time complexity a) NP-complete b) O(n?) c) O(n+2) d) O(n?) View Answer Answer: a Explanation: If the partial order has at most one minimal element, or it has at most one maximal element, then to test whether a partial order with multiple sources and sinks can be drawn as a crossing-free Hasse diagram or not it’s time complexity is NP-complete.4, Which of the following relation is a partial order as well as an equivalence relation? a) equal to(=) b) less than(<) c) greater than(>) d) not equal to(!=) “ View Answer Answer: a Explanation: The identity relation = on any set is a partial order in which every two distinct elements are incomparable and that depicts the relation of both a partial order and an equivalence relation. For non- linear orders, there are many advanced properties of posets.5. The relation < is a partial order if it is a) reflexive, antisymmetric and transitive b) reflexive, symmetric c) asymmetric, transitive d) irreflexive and transitive “ view Answer Answer: a Explanation: Let A is a set and s is a relation on A, then < is a partial order if it satisfies reflexive, antisymmetric, and transitive, i.e., for all x, y and z in P. That means, x s x (reflexivity); ifx < y and y < x then x = y (antisymmetry) and if x < y andy = d) == View Answer Answer: a Explanation: In the <(or less than and equal to) relation, every pair of elements is comparable. 7. \1n a poset (S, $), if there is no element néS with m 1) their number of components (vertices and edges) are same and 2) their edge connectivity is retained. Isomorphic graphs must have adjacency matrix representation.3. A cycle on n vertices is isomorphic to its complement. What is the value of n? a)5 b) 32 c) 17 d)8 view Answer Answer: a Explanation: A cycle with n vertices has n edges. Number of edges in cycle = n and number of edges in its complement = (n* (n-1)/2) - n. To be isomorphism, both graphs should have equal number of edges. This gives, (n*(n-1)/2) -n=n =n=54. How many perfect matchings are there in a complete graph of 10 vertices? a) 60 b) 945 c) 756 d) 127 View Answer Answer: b Explanation: Perfect matching is a set of edges such that each vertex appears only once and all vertices appear at least once (exactly one appearance). So for n vertices perfect matching will have n/2 edges and there won't be any perfect matching if n is odd. For n=10, we can choose the first edge in °C = 45 ways, second in °C2=28 ways, third in ®C5=15 ways and so on. So, the total number of ways 45*28*15*6*1=1 13400. But perfect matching being a set, order of elements is not important and the permutations 5! of the 5 edges are same only. So, total number of perfect matching is 113400/5! = 945.5. A graph G has the degree of each vertex is > 3 say, deg(V) = 3 V V € G such that 3|V| < 2|E| and 3|R| s 2|E|, then the graph is said to be (R denotes region in the graph) a) Planner graph b) Polyhedral graph c) Homomorphic graph d) lsomorphic graph A View Answer Answer: b Explanation: A simple connected planar graph is called a polyhedral graph if the degree of each vertex is(V) = 3 such that deg(V) = 3 V VE G and two conditions must satisfy i) 3|V| <2|E| andii)3|/R| <2|E].6. A complete n-node graph Kn is planar if and only if a)n26 b)n?=n+1 ons4 dyn+3 * View Answer Answer: c Explanation: Any graph with 4 or less vertices is planar, any graph with 8 or less edges is planar and a complete n-node graph K, is planar if and only ifn < 4. 7.Agraphis __if and only if it does not contain a subgraph homeomorphic to ks or k33. a) bipartite graph b) planar graph c) line graph d) euler subgraph I View Answer Answer: b Explanation: A graph is known as planar graph if and only if it does not contaiiiyN subgraph homeomorphic to ks or k3,3.8. 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 b) f(u) and f(v) are adjacent in H c) f(u * v) = f(u) + f(v) d) f(u) = flu)? + f(v)? * View Answer Answer: b Explanation: Two graphs G and H are said to be isomorphic to each other if there exist a one to one correspondence, say f between the vertex sets V(G) and V(H) and a one to one correspondence g between the edge sets E(G) and E(H) with the following conditions:- (i) for every vertex u in G, there exists a vertex u’ in H such that u’=f(u) and vice versa. (ii) for every edge uv in 4G, g(uv)=f(u)*f(v)=u'v’ is H.9. What is the grade of a planar graph consisting of 8 vertices and 15 edges? a) 30 b) 15 c) 45 d) 106 View Answer Answer: a Explanation: If G is a planar graph with n vertices and m edges then r(G) = 2mi.e. the grade or rank of G is equal to the twofold of the number of edges in G. So, the rank of the graph is 2*15=30 having 8 vertices and 15 edges.10. A is a graph with no homomorphism to any proper subgraph. a) poset b) core c) walk d) trail * View Answer Answer: b Explanation: A core can be defined as a graph that does not retract to any proper subgraph. Every graph G is homomorphically equivalent to a unique core called the core of G.