Scribd
Upload
27 views

Perform The Following Conversion: (3+3 Marks) A. (ABE) Ans: (101010111110)

1. The document provides examples of binary conversions and expanding Boolean functions into their canonical form. 2. It defines a minterm as a product of variables where each variable is complemented if its assigned value is 0 and shows the truth table for a Boolean function f(A,B,C). 3. It proves the identity x(x+y)=x using Boolean logic. 4. It asks to simplify two three-variable Boolean functions algebraically.

Uploaded by

Radha Raman
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
27 views

Perform The Following Conversion: (3+3 Marks) A. (ABE) Ans: (101010111110)

1. The document provides examples of binary conversions and expanding Boolean functions into their canonical form. 2. It defines a minterm as a product of variables where each variable is complemented if its assigned value is 0 and shows the truth table for a Boolean function f(A,B,C). 3. It proves the identity x(x+y)=x using Boolean logic. 4. It asks to simplify two three-variable Boolean functions algebraically.

Uploaded by

Radha Raman
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

1. Perform the following conversion: [ 3+3 Marks] a.

(ABE)16 Ans : (101010111110)2

b. (101011)2 Ans : (43)10

2. Expand the following Boolean functions into their canonical form: [ 3+3 Marks] In general, the unique algebraic expression for any Boolean function can be obtained from its truth table by using an OR operator to combined all minterms for which the function is equal to 1. A minterm, denoted as mi, where 0 i < 2n, is a product (AND) of the nvariables in which each variable is complemented if the value assigned to it is 0, and uncomplemented if it is 1. 1-interms= minterms for which the function F = 1. 0-minterms= minterms for which the function F= 0.

a.f(A,B,C)=AB+C =AB(C+C)+C(A+A)(B+B) =ABC+ABC+ABC+ABC+ABC+ABC A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 Minterms M0=ABC M1=ABC M2=ABC M3=ABC M4=ABC M5=ABC M6=ABC M7=ABC F 0 1 1 1 0 1 0 1 F 1 0 0 0 1 0 1 0

F=ABC+ABC+ABC+ABC+ABC F=ABC+ABC+ABC

b.f(A,B,C)=AB+AC+ABC =AB(C+C)+AC(B+B)+ABC =ABC+ABC+ACB+ABC+ABC

A 0 0 0 0 1 1 1 1

B 0 0 1 1 0 0 1 1

C 0 1 0 1 0 1 0 1

Minterms M0=ABC M1=ABC M2=ABC M3=ABC M4=ABC M5=ABC M6=ABC M7=ABC

AB 0 0 0 0 0 0 1 1

AC 0 1 0 1 0 0 0 0

ABC 0 0 0 0 0 1 0 0

F 0 1 0 1 0 1 1 1

F 1 0 1 0 1 0 0 0

F=ABC+ABC+ABC+ABC+ABC F=ABC+ABC+ABC f(A,B,C) = ABC' + ABC + AB'C 3.Prove that x(x+y)=x Using Boolean logic, =x*x + x*y But x*x = x =x + x*y =x(1+y) =x Hence proved

4.Simplify the following three-variable Boolean functions algebraically: [ 3+3 Marks] a. f1 = 1, 2, 5, 6

BC A 0 1 0 00 1 1 01 1 1 10 11

F=ABC+ABC+ABC+ABC =BC(A+A) + BC(A+A) = BC+BC

b. f2= 0, 1, 2, 3, 7

BC A 0 1 1 00 1 0 01 1 0 10 1 1 11

F=ABC+ABC+ABC+ABC+ABC+ABC =AB(C+C)+AB(C+C)+BC(A+A) =AB+AB+BC =A(B+B)+BC =A+BC

You might also like