Question

The logic expression which is NOT true in Boolean algebra is
(A) [1+1].1=0
(B) [1+0].1=0
(C) [1+0].1=0
(D) [1+1].1=0

Answer 1

Hint: We should know that in mathematics and mathematical logic, Boolean algebra is the branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0, respectively. Boolean Algebra is used to analyse and simplify the digital or logic circuits. It uses only the binary numbers that are 0 and 1. It is also called Binary Algebra or logical Algebra. Boolean algebraic theorems are the theorems that are used to change the form of a Boolean expression. Sometimes these theorems are used to minimize the terms of the expression and sometimes they are used just to transfer the expression from one form to another. There are Boolean algebraic theorems in digital logic: 1.

Complete step-by step answer:
It should be known to us that The Logic NOT Gate is the most basic of all the logical gates and is often referred to as an Inverting Buffer or simply an Inverter. A NOT gate performs logical negation on its input. In other words, if the input is true, then the output will be false.
Let us know form the table:
[1+1].1 = [0+0].1 =0
[1+0].1 = [0+0].1 = 0
[1+0].1 = [0+0].0=0
[1.1].1 = 1.1 = 1$\ne$0
So, we can say that the logic expression which is NOT true in Boolean algebra is [1+1].1=0

Hence, the correct answer is Option D.

Note: We know that logic gates are the basic building blocks of any digital system. It is an electronic circuit having one or more than one input and only one output. The relationship between the input and the output is based on a certain logic. Based on this, logic gates are named as AND gate, OR gate, NOT gate etc. In most modern computers, logic gates are built using transistors combined with other electrical components like resistors and diodes. Those are all wired together to make sure that they transform the inputs in the way we expect. The table used to represent the Boolean expression of a logic gate function is commonly called a Truth Table. A logic gate truth table shows each possible input combination to the gate or circuit with the resultant output depending upon the combination of these input(s).