# MCQ IN COMPUTER SCIENCE & ENGINEERING

## COMPUTER SCIENCE AND ENGINEERING

### COMPUTER ARCHITECTURE

 Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Simplified form of the boolean expression (X + Y + XY) (X + Z) is
 A X + Y + Z B XY + YZ C X + YZ D XZ + Y
Explanation:

Detailed explanation-1: -Y = Y. Hence, the reduced form of the Boolean expression A = XY + X(Y+Z) + Y(Y+Z) is A = Y+XZ.

Detailed explanation-2: -The Karnaugh map (K–map), introduced by Maurice Karnaughin in 1953, is a grid-like representation of a truth table which is used to simplify boolean algebra expressions. A Karnaugh map has zero and one entries at different positions.

Detailed explanation-3: -It is known that the product of two values can be established by the conjunction of x and y. And the sum of two values can be established by the disjunction of x and y. The result of the proposition is shown in the truth below. Hence, the value of the Boolean function xy + xz is 11100000.

There is 1 question to complete.