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

Types of pipelines - computer architecture, Types of Pipelines: Instr...

Types of Pipelines: Instructional pipeline  It is used where different stages of an instruction fetch and execution take place in a pipeline. Arithmetic pipeline

What is an accessor in c++, An accessor is a class operation that does not ...

An accessor is a class operation that does not change the state of an object in C++. The access or functions require to be declared as const operations

Why gateways are used during mail transfer, Why Gateways are used during ma...

Why Gateways are used during mail transfer? Email using SMTP effort best while both the sender and the receiver are on the internet and can hold TCP connections in between send

State about the harvard mark I and the bug, Harvard mark i and the bug ...

Harvard mark i and the bug The next important effort towards devising an electromechanical computer was done at the harvard University, jointly sponsored by the Department of U

Illustrate the benefits of functional model, Illustrate the benefits of Fun...

Illustrate the benefits of Functional model Functional model shows how values are computed. This model describes decisions or object structure without regard for sequencing. I

Explain the regular expression and transition diagram, State the relation a...

State the relation among Regular Expression, Transition Diagram and Finite State Machines. By using a simple instance establish your claim.   Answer: For each regular language,

Inverse of exclusive or known as xnor gate, Truth table of NAND and NOR can...

Truth table of NAND and NOR can be made from NOT (A AND B) and NOT (A OR B) correspondingly. Exclusive OR (XOR) is a special gate whose output is one only if two inputs aren't equa

Show the liability of cpu in interrupt cycle, Q. Show the liability of CPU ...

Q. Show the liability of CPU in interrupt cycle? In the interrupt cycle the liability of CPU/Processor is to ensure whether any interrupts have happened checking presence of in

Find out the 2's complement of 1101110, The 2's complement of the number 11...

The 2's complement of the number 1101110 is ? Ans. 1's complement of 1101110 is = 0010001 ans hence 2's complement of 1101110 is = 0010001 + 1 = 0010010.

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