De-Morgan Theorem Question & AnswersApril 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 HintA mathematician.2). De-morgans theorem solves _____ expressions? Boolean algebra Logic gates Arithmetic Both a and b HintDigital circuit representation. 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 Hint2 types.4). Logic high in Boolean language is represented with _____? Logic 0 Logic 1 Logic X None of the above HintShort circuit.5). Logic low in Boolean language is represented with _____? Logic 0 Logic 1 Logic X None of the above HintOpen circuited.6). Which of the following processes used in solving De-Morgans theorem? Truth tables Logical expressions Logic gates Both a and b Hint2 processes.7). According to De-Morgans theorem an inverted AND gate operation result is similar to _____ type of logic gate operation? OR NOT XOR NOR Hinta+b is which operation?8). Which of the following logical operation of does a De-Morgans theorem performs? AND OR NOT All the above Hint3 operations.9). Which of the following is the De-Morgans formula for (X.Y)’? X’ + Y’ X’ – Y’ X’ * Y’ X’/Y’ HintSum of terms.10). A NAND gate in De-Morgans formula for (X.Y)’ is also called ___? Bubbled OR Bubbled NOR Bubbled XOR Bubbled NOT HintSum of terms.11). De-Morgans theorem can be verified using _____? Logic gates Truth table Graphs Both a and b Hint2 terms.12). A truth table is a ______ table? Mathematical Logical Boolean All the above Hint3 forms.13). A truth table has ___ number of columns for each input variable? 1 2 3 4 HintMinimum value.14). A truth table has _____ number of unary operations? 1 2 3 4 HintEven number.15). A never true of unary operation is also called ___? Unary falsum Unary identity Unary negation Unary true HintIncorrect value.16). Which of the following is the negation value of ‘true’? True False Don’t care None of the above HintOpposite term.17). Which of the following is the negation value of ‘false’? True False Don’t care None of the above HintOpposite term.18). Which of the following is the output of AND gate if input is (0,0)? 0 1 X None of the above HintLogic low.19). Which of the following is the output of AND gate if input is (0,1)? 0 1 X None of the above HintLogic low.20). Which of the following is the output of AND gate if input is (1,0)? 0 1 X None of the above HintLogic low.21). Which of the following is the output of AND gate if input is (1,1)? 0 1 X None of the above HintLogic high.22). Which of the following is the output of OR gate if input is (0,0)? 0 1 X None of the above HintLogic low.23). Which of the following is the output of OR gate if input is (0,1)? 0 1 X None of the above HintLogic High.24). Which of the following is the output of OR gate if input is (1,0)? 0 1 X None of the above HintLogic High.25). Which of the following is the output of OR gate if input is (1,1)? 0 1 X None of the above HintLogic High.De-Morgan Theorem MCQs for Quiz26). Which of the following is the output of NAND gate if input is (0,0)? 0 1 X None of the above HintLogic High. 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 HintLogic High.28). Which of the following is the output of NAND gate if input is (1,0)? 0 1 X None of the above HintLogic High.29). Which of the following is the output of NAND gate if input is (1,1)? 0 1 X None of the above HintLogic low.30). Which of the following is the output of NOR gate if input is (0,0)? 0 1 X None of the above HintLogic high.31). Which of the following is the output of NOR gate if input is (0,1)? 0 1 X None of the above HintLogic low. 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 HintLogic low.33). Which of the following is the output of NOR gate if input is (1,1)? 0 1 X None of the above HintLogic low.34). Which of the following symbol represents logical AND operation? . + ^ - HintProduct of terms. Read more about AND Gate.35). Which of the following symbol represents logical OR operation? . + ^ - HintSum of terms. Read more about OR Gate.36). Which of the following symbol represents logical NOT operation? . + ^ - Hinta (bar). Read more about NOT Gate37). Which of the following symbol represents logical NAND operation? (A . B) bar (A + B) bar A ^ B A - B HintOpposite of AND operation.38).Which of the following symbol represents logical NOR operation? (A . B) bar (A + B) bar A ^ B A - B HintOpposite of OR operation.39). Which of the following logic gates are required for representing DeMorgans NAND gate? AND NOT OR Both a and b HintStandard gates.40). Which of the following logic gates are required for representing DeMorgans negative OR gate? AND NOT OR Both a and b Hint3 gates.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 HintBasic theorem.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 HintAfter basic theorem.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 HintAccording to de-Morgan’s formula, LHS=RHS.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 HintAccording to de-Morgan’s formula. LHS=RHS.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 HintAccording to de-Morgan’s formula LHS=RHS.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 HintAccording to de-Morgan’s formula LHS=RHS.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 HintAccording to de-Morgan’s formula LHS=RHS.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 HintAccording to de-Morgan’s formula LHS=RHS.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 HintAccording to de-Morgan’s formula LHS=RHS.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 HintAccording to de-Morgan’s formula LHS=RHS.De-Morgan Theorem Questions and Answers51). 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 HintAccording to de-Morgan’s formula LHS=RHS.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 HintAccording to de-Morgan’s formula LHS=RHS.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 HintAccording to de-Morgan’s formula LHS=RHS.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 HintAccording to de-Morgan’s formula LHS=RHS.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 HintAccording to de-Morgan’s formula LHS=RHS.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 HintAccording to de-Morgan’s formula LHS=RHS.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 HintAccording to de-Morgan’s formula LHS=RHS.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 HintAccording to de-Morgan’s formula LHS=RHS.59). Which of the following are the applications of De-Morgan’s theorem? Java programming Electrical engineering domain SAS code verification All the above Hint3 applications.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 Hint2 limitations.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 Hint3 reasons.De-Morgan Theorem MCQs for Exams62). Boolean Algebra is also called ___? Logical Algebra Switching Algebra Binary logic All the above Hint2 names.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 HintObtains same result on interchanging operands.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 HintAND, OR operations.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) HintProduct and addition operation = addition and product operation.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 HintAND operation with ‘0’ is 0 and OR operation with ‘1’ is ‘1’.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 HintProduct of terms.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 Hint(AB’ .(A+C)’)+A’B.(A+B+C’)’ = A(bar) +B (!+A(bar) C)=?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 HintIntersection formula.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 HintUnion formal.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 HintAND/OR operation results in input value.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 HintResults in ‘0’ or ‘1’ as output.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 HintTwice complement.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 HintLaw applicable for complex expressions.75). Which of the following are the theorems of Boolean algebra? De-Morgan’s theorem Consensus theorem Shannon’s theorem All the above Hint3 theorems. Please fill in the comment box below. Time is Up! Time's up