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

What is java applet, A Applet is a java program that runs within a web brow...

A Applet is a java program that runs within a web browser.

High level language program characteristics, Q. High Level Language Program...

Q. High Level Language Program Characteristics? So it is clear that new architectures must support high-level language programming. A high-level language system can be implemen

What all 1's represents in 32bit ip addressing scheme, In 32bit IP Addressi...

In 32bit IP Addressing scheme all 1's represent? All 1's represent limited broadcast in 32 bit IP Addressing scheme.

What information is stored in a typical TLB table entry, In a simple paging...

In a simple paging system, what information is stored in a typical Look-aside Buffers  TLB table entry? A classical TLB table entry contains page# and frame#, while a logical

Minterms, A minterm is an AND expression involving all input variables in e...

A minterm is an AND expression involving all input variables in either inverted or non-inverted form.For one particular row the associated mintermis the only minterm which equals l

Explain bitwise-and operator, Bitwise-AND Operator: & AND-expression : ...

Bitwise-AND Operator: & AND-expression : relational-expression AND-expression & equality-expression The bitwise-AND operator (&) compares each bit of its first operand t

Analysis of parallel algorithms, A generic algorithm is mostly analysed on ...

A generic algorithm is mostly analysed on basis of subsequent parameters: the space complexity (amount of space required) and the time complexity (execution time). Generally we giv

Error handling in hard disk, Error handling in Hard disk in computer archit...

Error handling in Hard disk in computer architecture : Modern drives also make widespread use of Error Correcting Codes (ECCs), specifically Reed-Solomon error correction.

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