CHAPTER 6

Q.1. Ans. Q.2. Ans.

BOOLEAN ALGEBRA

(SHORT QUESTIONS) What is Boolean Algebra? Boolean algebra is the algebra of logic. Boolean algebra uses symbols to represent logical statements instead of words. What are Boolean expressions? An expression formed with binary variables, constants, Boolean operators as well as parentheses is known as Boolean expressions. It is a logical statement which gives result either true or false. What is literal? Suppose two variables x and y are used in a Boolean function. Each variable may appear in the function in two forms, i.e. it may appear in the complement form or without complement form. Each of these forms is called a literal. What is identity element? There is an identity element 1 with respect to AND (.) such that for A: 1.A=A There is an identity element 0 with respect to OR (+) such that for A: 0+A=A What is Karnaugh Map? Karnaugh Map is also referred to as K-map. It provides an efficient way to solve / simplify Boolean functions. It is a tool used to transform a truth table of expression into a simplified logic circuit. State the theorem: x . (x + y) = x L.H.S. = x . (x + y) = x .1 + x . y (Identity element) = x . (1 + y) (by distributive law) =x.1 (1 + y = 1) =x (identity element) = R.H.S Hence the theorem is proved. What is minterms? If two Boolean variables x and y then products using these variables, x . y, x . y, x . y, x . y . These are called standard products or minterms with two variables.

Q.3. Ans.

Q.4. Ans.

Q.5. Ans.

Q.6. Ans.

] Q.7. Ans.

Q.8. Ans.

What is Boolean function? A Boolean function is an expression formed with binary variables may an equal sign. The Boolean operators, parenthesis and equal to either 0 or 1. The value returned by Boolean function is also equal to either 0 or 1.

Q.9. Ans.

How many types of logical operators? Write their names. There are three logical operators. a) OR Operator b) AND operator c) NOT Operator

Q.10. State the theorem: x + x = x Ans. L.H.S. =x+x = x .1 + x.1 (Identity element) =x . (1 + 1) (by distributive law) =x.1 (1 + 1 = 1) =x (Identity element) = R.H.S Hence the theorem is proved. Q.11. What are Boolean Constants? Ans. The quantities that may not change their values are called constants. If B ={0 , 1} then 0 and 1 are the Boolean constants. Q.12. What is truth table? Ans. The table that represents the output of a Boolean expression for all the possible combinations of input values is called the truth table. TRUTH TABLE OR Operation AND Operation Not Operation X= A A B X= A +B A B X= A . B A 0 0 0 0 0 0 0 1 0 1 1 0 1 0 1 0 1 0 1 1 0 0 1 1 1 1 1 1 Q.13. What is a gate? Ans. Gate is an electronic circuit that receives one or more than one inputs and gives output. It is used like a rapidly working binary switch. It has only two conditions i.e. ON and OFF. Q.14. What are Boolean Variables? Ans. If B = {0,1 with operators dot (.) and (+) is a Boolean algebra, then the variables x, y etc are called Boolean variables. Q.15. What are maxterms? Ans. If two Boolean variables x and y, then sums using these variables, x + y, x + y, x + y, x + y. These are called a standard sums or maxterms with two variables. Q.16. If x = 0, y = 1 and z = 0, then find the value of x . y + x . z + x . y.

Ans.

As x = 0, then x = 1 Thus y = 0, and z = 1 Now putting the values: =x.y+x.z+x.y =1.1+0.1+0.0 =1+0+0 =1

Q.17. How many elements of Boolean algebra? Ans. There are two elements of Boolean algebra. a) Boolean constants b) Boolean variables Q.18. What is the function of NOT operator? Ans. The process to take the complement of a binary variable or number is called logical NOT operation. NOT operation of a variable x is represented by placing bar over the variable such as x.