Bissoy.com
Doctors Medicines MCQs Q&A

The Boolean expression (A + B.C’.D) when complemented results in (A + B).(A + C’).(A + D).

The Boolean expression (A + B.C’.D) when complemented results in (A + B).(A + C’).(A + D). Correct Answer False

The steps to derive the solution are given below. Using DeMorgan’s law, = (A + B.C’.D)’ = A’.(B.C’.D)’ = A’.(B’ + C + D’) Hence the answer is false.

Related Questions

interface Base{ boolean m1 (); byte m2(short s);}

which two code fragments will compile?
1. interface Base2 implements Base {}2. abstract class Class2 extends Base { public boolean m1(){ return true; }}3. abstract class Class2 implements Base {}4. abstract class Class2 implements Base { public boolean m1(){ return (7 > 4); }}5. abstract class Class2 implements Base { protected boolean m1(){ return (5 > 7) }}
What is the function Y = A + B̅C in Product-of-Sums (POS) form? 
Which of the following problems is NOT NP-complete? I. Checking satisfiability of arbitrary Boolean formulae II. Checking satisfiability of Boolean formulae in conjunctive normal form (CNF/product of sums) III. Checking satisfiability of Boolean formulae in disjunctive normal form (DNF/sum of products)
You are given a boolean expression which consists of operators &, | and ∧ (AND, OR and XOR) and symbols T or F (true or false). You have to find the number of ways in which the symbols can be parenthesized so that the expression evaluates to true. This is the boolean parenthesization problem. Which of the following methods can be used to solve the problem?
What specifies the values of a Boolean expression for every possible combination of values of the variables in the Boolean expression?
Minimize the Boolean expression using Boolean identities: A′B+ABC′+BC’+AB′C′.
Minimize the following Boolean expression using Boolean identities. F(A,B,C) = (A+BC’)(AB’+C)
Which of the following statements about Regular Expression is/are incorrect? A. The union of two regular expressions is also a regular expression B. The concatenation of two regular expressions is also a regular expression C. The iteration of a regular expression is also a regular expression
The Boolean expression (A + B.C’.D) when factored results in (A + B).(A + C’).(A + D).
Identify the Boolean expression that results from the following VHDL code. D <= A or B; Y <= D nand C;