Simplify the boolean expression, Computer Engineering

Assignment Help:

Simplify the Boolean expression F = C(B + C)(A + B + C).

Ans. Simplification of the given Boolean Expression F = C (B +C) (A+B+C) given as
F = C (B+C) (A+B+C)
= CB + CC [(A+B+C)]
= CB + C [(A+B+C)]   (Q CC = C)
= CBA + CBB + CBC + CA + CB + CC
= ABC + CB + CB + CA + CB + CC  (Q CBB =CB & CBC = CB)
= ABC + CB + CA + C   (Q CB+CB+CB = CB; CC = C)
= ABC + BC + C (1+A)
= ABC + BC + C    (Q 1+A = 1)
= ABC + C (1+B)
= ABC + C   (Q 1+B = 1)
= C (1+AB) = C {Q (1+AB)=1}


Related Discussions:- Simplify the boolean expression

Learning weights in perceptrons, Learning Weights in Perceptrons: Furt...

Learning Weights in Perceptrons: Furthermore details are we will look at the learning method for weights in multi-layer networks next lecture. Thus the following description o

Explain how a node can be inserted into an avl tree, Explain how a node can...

Explain how a node can be inserted into an AVL tree. We can insert a node into an AVL tree through the insertion algorithm for binary search trees in which we compare the key o

What is rdram, Direct Rambus DRAM or DRDRAM (sometimes just known as Rambus...

Direct Rambus DRAM or DRDRAM (sometimes just known as Rambus DRAM or RDRAM) is a type of synchronous dynamic RAM. RDRAM was formed by Rambus inc., in the mid-1990s as a replacement

Explain about merge sort circuit, Q. Explain about Merge sort circuit? ...

Q. Explain about Merge sort circuit? First split the given sequence of n numbers in two parts every part comprising of n/2 numbers. Afterwards recursively divide the sequence i

Networking, compare 2g , 3g , and 4g also with advantage of 3g and 4g.

compare 2g , 3g , and 4g also with advantage of 3g and 4g.

Evaluate total expense of algorithm, Q. Evaluate Total expense of algorithm...

Q. Evaluate Total expense of algorithm? Lastly, the total expense of algorithm is a product of the total number of processors required for computation and time complexity of th

Algorithm, i need algorithm for padovan string

i need algorithm for padovan string

How many address bits are required to represent 4K memory, How many address...

How many address bits are required to represent 4K memory ? Ans. 12 address bits are required for representing 4K memory, as 4K = 2 2 x 2 10   = 2 12 Therefore 1K = 1024

Convert logic circuit in a binary code, The logic circuit given below, conv...

The logic circuit given below, converts a binary code y 1 y 2 y 3 into Ans. Gray code is X1 = Y1,   X2 = Y1 XOR Y2  ,   X3 = Y1 XOR Y2 XOR Y3 For

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd