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 an assembly language, An assembly language is a? Ans. Low level...

An assembly language is a? Ans. Low level programming language is an assembly language.

Explain isdn address structure and its working, Draw the ISDN address struc...

Draw the ISDN address structure and explain how the addressing works? Address Structure: The ISDN address structure is demonstrated in figure. ISDN number part has a maximum

Plot2fnhand, Write a function "plot2fnhand" that will receive 2 function ha...

Write a function "plot2fnhand" that will receive 2 function handles as input arguments, and will show in two Figure Windows plots of these functions, with the function names in the

Define top-down parsing techniques, Define Top-down parsing Techniques ...

Define Top-down parsing Techniques Top-down parsing can be observed as an attempt to find left-most derivations of an input-stream through searching for parse trees using a top

Describe data transfer instructions, Q. Describe Data Transfer Instructions...

Q. Describe Data Transfer Instructions? These instructions transfer data from one location in the computer to another location without altering the data content. Most common tr

Basic concept of data parallelism, Basic Concept of Data Parallelism T...

Basic Concept of Data Parallelism Thinking the condition where the same problem of submission of „electricity bill? is Handled as follows: Again, three are counters. Howeve

Minimization of the logic function using k-maps, Minimize the logic functio...

Minimize the logic function F(A, B, C, D) = ∑ m(1,3,5,8,9,11,15) + d(2,13) using K-maps Ans. The logic function minimization of F(A, B, C, D) = ∑ m(1,3,5,8,9,11.15) + d(2,13) by

C++, minimum self program

minimum self program

Centres of keycaps, A full size keyboard has distance between centres of ke...

A full size keyboard has distance between centres of keycaps (keys) like 19mm (0.75in).The keycaps have a top of nearly 0.5in (12.5in) that is shaped as a sort of dish to help you

Determine about the programmable read only memory, Programmable read only m...

Programmable read only memory (PROM) A PROM is a memory chip on which data can be written only one time. Once a program has been written onto a PROM, it's permanent. Unlike RAM

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages