De-Morgan Theorem Question & Answers April 5, 2022 By WatElectronics This article lists 75 De-Morgan Theorem MCQs for engineering students. All the De-Morgan Theorem Questions & Answers given below include a hint and a link wherever possible to the relevant topic. This is helpful for users who are preparing for their exams, interviews, or professionals who would like to brush up on the fundamentals of the De-Morgan Theorem. Switching algebra or Boolean algebra is a method for solving logical values represented in ‘0’s’ or ‘1’s’ on following certain standard Boolean rules. There are multiple Boolean algebra laws such as commutative, associative, distributive, etc, for solving Boolean expressions. The theorems for solving Boolean algebra include De-Morgan’s theorem, Consensus theorem, and Shannon’s theorem. Where De-Morgan’s theorem is solved according to the duality principle of swapping variables and operators in an expression. The reason behind De-Morgan’s theorem is to design a digital circuit and explain the complement of the sum of all input variables that equals the product of the complement of every term. De-Morgan’s theorem is defined with two statements namely (X . Y)’ = X’ + Y’ and (X + Y)’ = X’ Y’. De-Morgan’s theorem is applicable for 2 types of components namely high circuit design and computer programming. The limitations of De-Morgan’s theorem include the relation of conjunction and inclusive dis-junction. 1). Which of the following scientist represented De- Morgans theorem? Augustus De-Morgan Charles De-Morgan Richard De-Morgan None of the above None Hint 2). De-morgans theorem solves _____ expressions? Boolean algebra Logic gates Arithmetic Both a and b None Hint Read more about Logic Gates. 3). De-morgans theorem is applicable for _____ types of components? High circuit design Computer programming Computer hardware Both a and b None Hint 4). Logic high in Boolean language is represented with _____? Logic 0 Logic 1 Logic X None of the above None Hint 5). Logic low in Boolean language is represented with _____? Logic 0 Logic 1 Logic X None of the above None Hint 6). Which of the following processes used in solving De-Morgans theorem? Truth tables Logical expressions Logic gates Both a and b None Hint 7). According to De-Morgans theorem an inverted AND gate operation result is similar to _____ type of logic gate operation? OR NOT XOR NOR None Hint 8). Which of the following logical operation of does a De-Morgans theorem performs? AND OR NOT All the above None Hint 9). Which of the following is the De-Morgans formula for (X.Y)’? X’ + Y’ X’ – Y’ X’ * Y’ X’/Y’ None Hint 10). A NAND gate in De-Morgans formula for (X.Y)’ is also called ___? Bubbled OR Bubbled NOR Bubbled XOR Bubbled NOT None Hint 11). De-Morgans theorem can be verified using _____? Logic gates Truth table Graphs Both a and b None Hint 12). A truth table is a ______ table? Mathematical Logical Boolean All the above None Hint 13). A truth table has ___ number of columns for each input variable? 1 2 3 4 None Hint 14). A truth table has _____ number of unary operations? 1 2 3 4 None Hint 15). A never true of unary operation is also called ___? Unary falsum Unary identity Unary negation Unary true None Hint 16). Which of the following is the negation value of ‘true’? True False Don’t care None of the above None Hint 17). Which of the following is the negation value of ‘false’? True False Don’t care None of the above None Hint 18). Which of the following is the output of AND gate if input is (0,0)? 0 1 X None of the above None Hint 19). Which of the following is the output of AND gate if input is (0,1)? 0 1 X None of the above None Hint 20). Which of the following is the output of AND gate if input is (1,0)? 0 1 X None of the above None Hint 21). Which of the following is the output of AND gate if input is (1,1)? 0 1 X None of the above None Hint 22). Which of the following is the output of OR gate if input is (0,0)? 0 1 X None of the above None Hint 23). Which of the following is the output of OR gate if input is (0,1)? 0 1 X None of the above None Hint 24). Which of the following is the output of OR gate if input is (1,0)? 0 1 X None of the above None Hint 25). Which of the following is the output of OR gate if input is (1,1)? 0 1 X None of the above None Hint De-Morgan Theorem MCQs for Quiz 26). Which of the following is the output of NAND gate if input is (0,0)? 0 1 X None of the above None Hint Read more about NAND Gate . 27). Which of the following is the output of NAND gate if input is (0,1)? 0 1 X None of the above None Hint 28). Which of the following is the output of NAND gate if input is (1,0)? 0 1 X None of the above None Hint 29). Which of the following is the output of NAND gate if input is (1,1)? 0 1 X None of the above None Hint 30). Which of the following is the output of NOR gate if input is (0,0)? 0 1 X None of the above None Hint 31). Which of the following is the output of NOR gate if input is (0,1)? 0 1 X None of the above None Hint Read more about NOR Gate. 32). Which of the following is the output of NOR gate if input is (1,0)? 0 1 X None of the above None Hint 33). Which of the following is the output of NOR gate if input is (1,1)? 0 1 X None of the above None Hint 34). Which of the following symbol represents logical AND operation? . + ^ - None Hint Read more about AND Gate. 35). Which of the following symbol represents logical OR operation? . + ^ - None Hint Read more about OR Gate. 36). Which of the following symbol represents logical NOT operation? . + ^ - None Hint Read more about NOT Gate 37). Which of the following symbol represents logical NAND operation? (A . B) bar (A + B) bar A ^ B A - B None Hint 38).Which of the following symbol represents logical NOR operation? (A . B) bar (A + B) bar A ^ B A - B None Hint 39). Which of the following logic gates are required for representing DeMorgans NAND gate? AND NOT OR Both a and b None Hint 40). Which of the following logic gates are required for representing DeMorgans negative OR gate? AND NOT OR Both a and b None Hint 41).Which of the following DeMorgans theorem states when multiple variables are AND and negated they are equivalent to OR of the complements if individual variables. First theorem Second theorem Third theorem Fourth theorem None Hint 42). Which of the following DeMorgans theorem states when multiple variables are Or’ed and negated they are equivalent to AND of the complements if individual variables. First theorem Second theorem Third theorem Fourth theorem None Hint 43). Which of the following is the output of (X+Y+Z)’ = (X’ Y’ Z’) when (X Y Z) = ( 0 0 0)? 1 0 X None of the above None Hint 44). Which of the following is the output of (X+Y+Z)’ = (X’ Y’ Z’) when (X Y Z) = ( 0 0 1 )? 0 1 X None of the above None Hint 45). Which of the following is the output of (X+Y+Z)’ = (X’ Y’ Z’) when (X Y Z) = ( 0 1 0 )? 1 0 X None of the above None Hint 46). Which of the following is the output of (X+Y+Z)’ = (X’ Y’ Z’) when (X Y Z) = ( 0 1 1 )? 1 0 X None of the above None Hint 47). Which of the following is the output of (X+Y+Z)’ = (X’ Y’ Z’) when (X Y Z) = ( 1 0 0 )? 1 0 X None of the above None Hint 48). Which of the following is the output of (X+Y+Z)’ = (X’ Y’ Z’) when (X Y Z) = ( 1 0 1 )? 1 0 X None of the above None Hint 49). Which of the following is the output of (X+Y+Z)’ = (X’ Y’ Z’) when (X Y Z) = ( 1 1 0 )? 1 0 X None of the above None Hint 50). Which of the following is the output of (X+Y+Z)’ = (X’ Y’ Z’) when (X Y Z) = ( 1 1 1 )? 1 0 X None of the above None Hint De-Morgan Theorem Questions and Answers 51). Which of the following is the output of (X’ Y’ Z’) = (X+Y+Z)’ when (X Y Z) = ( 0 0 0 )? 1 0 X None of the above None Hint 52). Which of the following is the output of (X’ Y’ Z’) = (X+Y+Z)’ when (X Y Z) = ( 0 0 1 )? 1 0 X None of the above None Hint 53). Which of the following is the output of (X’ Y’ Z’) = (X+Y+Z)’ when (X Y Z) = ( 0 1 0 )? 1 0 X None of the above None Hint 54). Which of the following is the output of (X’ Y’ Z’) = (X+Y+Z)’ when (X Y Z) = ( 0 1 1 )? 1 0 X None of the above None Hint 55). Which of the following is the output of (X’ Y’ Z’) = (X+Y+Z)’ when (X Y Z) = ( 1 0 0 )? 1 0 X None of the above None Hint 56). Which of the following is the output of (X’ Y’ Z’) = (X+Y+Z)’ when (X Y Z) = ( 1 0 1 )? 1 0 X None of the above None Hint 57). Which of the following is the output of (X’ Y’ Z’) = (X+Y+Z)’ when (X Y Z) = ( 1 1 0 )? 0 1 X None of the above None Hint 58). Which of the following is the output of (X’ Y’ Z’) = (X+Y+Z)’ when (X Y Z) = ( 1 1 1 )? 1 0 X None of the above None Hint 59). Which of the following are the applications of De-Morgan’s theorem? Java programming Electrical engineering domain SAS code verification All the above None Hint 60). Which of the following are the limitations of De-Morgan’s theorem? Relation of conjunction Inclusive dis-junction Invalid data results Invalid data results None Hint 61). Which of the following is the reason behind De-Morgan’s theorem? Design digital circuit Explains complement of sum of all input variables Equals the product of the complement of every term All the above None Hint De-Morgan Theorem MCQs for Exams 62). Boolean Algebra is also called ___? Logical Algebra Switching Algebra Binary logic All the above None Hint 63). Which of the following is the example of commutative law of Boolean Algebra? X + Y = Y + X X.Y = Y.X X +(Y+Z) = (X+Y)+Z Both a and b None Hint 64). Which of the following is the example of associate law of Boolean Algebra? X + Y = Y + X X.Y = Y.X X +(Y+Z) = (X+Y)+Z Both a and b None Hint 65). Which of the following is the example of distributive law of Boolean Algebra? X + Y = Y + X X.Y = Y.X X +(Y+Z) = (X+Y)+Z X .(Y+Z) = (X.Y) + (X.Z) None Hint 66). Which of the following is the example of annulment law of Boolean Algebra? X + Y = Y + X X.Y = Y.X X +(Y+Z) = (X+Y)+Z X.0=X and X.1=X None Hint 67). Which of the following is the example of identity law of Boolean Algebra? X + Y = Y + X X.Y = Y.X X +0 = X X.0=X and X.1=X None Hint 68). Which of the following is the output of (AB’ .(A+C)’)+A’B.(A+B+C’)’? A(bar) +B(1+A(bar) C) A (bar) + B B (bar) + A Both a and b None Hint 69). The formula (A U B) bar = ? A (bar) n B (bar) A (bar) U B (bar) A (bar) + B (bar) Both a and b None Hint 70). The formula (A n B) bar = ? A (bar) n B (bar) A (bar) U B (bar) A (bar) + B (bar) Both a and b None Hint 71). Which of the following is the example of idempotent law of Boolean Algebra? X + Y = Y + X X.Y = Y.X X +(Y+Z) = (X+Y)+Z X+X=X and X.X=X None Hint 72). Which of the following is the example of complement law of Boolean Algebra? X + Y = Y + X X = 0 and X+=1 X +(Y+Z) = (X+Y)+Z X+X=X and X.X=X None Hint 73). Which of the following is the example of double negation law of Boolean Algebra? X + Y = Y + X ((X)’) = X X +(Y+Z) = (X+Y)+Z X+X=X and X.X=X None Hint 74). Which of the following is the example of absorption law of Boolean Algebra? X + Y = Y + X X + (X,Y) =X and X. (X+Y)=X X +(Y+Z) = (X+Y)+Z X+X=X and X.X=X None Hint 75). Which of the following are the theorems of Boolean algebra? De-Morgan’s theorem Consensus theorem Shannon’s theorem All the above None Hint Please fill in the comment box below. Time's up