Write the truth table and simplify karnaugh map, Computer Engineering

Assignment Help:

For F = A.B.C + B.C.D + A‾.B.C ,  write  the  truth  table and simplify using Karnaugh map.

And. Simplification of Logic Function F = A B C + B C‾ D + A‾ B C. Therefore the Truth Table is specified in Table no.1

Inputs

 

A                B                  C                   D

Output

(F)

0                 0                  0                  0

0

0                 0                  0                  1

0

0                 0                  1                  0

0

0                 0                  1                  1

0

0                 1                  0                  0

0

0                 1                  0                  1

1

0                 1                  1                  0

1

0                 1                  1                  1

1

1                 0                  0                  0

0

1                 0                  0                  1

0

1                 0                  1                  0

0

1                 0                  1                  1

0

1                 1                  0                  0

0

1                 1                  0                  1

1

1                 1                  1                  0

1

1                 1                  1                  1

1

                                                                                          Table no.1


Now the Karnaugh Map is represented in fig.(a).
The simplified expression is F = BC + BD

2453_write  the  truth  table and simplify Karnaugh map.png


Related Discussions:- Write the truth table and simplify karnaugh map

Define elimination of common sub expression, Explain Elimination of common ...

Explain Elimination of common sub expression during code optimization An optimizing transformation is a regulation for rewriting a segment of a program to enhance its execution

Bit pair recoding and 2’s complement, Explain bit pair recoding with an exa...

Explain bit pair recoding with an example? Ans: Bit pair recoding halves the maximum number of summands. Group the Booth-recoded multiplier bits in pairs and see the following

History of parallel computers, History Of Parallel Computers The test ...

History Of Parallel Computers The test with and implementations of the utilize of parallelism started year back in the 1950s by the IBM.  The IBM enlarges computers also calle

What is the purpose of the enableevents() method, The enableEvents() method...

The enableEvents() method is used to enable an event for a certain object. Normally, an event is enabled when a listener is added to an object for a certain event. The enableEvents

Subtract, Write the Add/subtract rule for floating point numbers. Ans:...

Write the Add/subtract rule for floating point numbers. Ans: a. Select the number with the smaller exponent and shift its mantissa right a number of steps equal to the differe

Classes, write a program to copt values of object without using copy constr...

write a program to copt values of object without using copy constructor or = operator

Analysis of algorithms, Analysis of Algorithms For this task, each stu...

Analysis of Algorithms For this task, each student should do two things: An empirical analysis of the runtime and comparisons made for all algorithms as a function of input si

Facsimile , FACSIMILE : This is often known as 'fax' and it represents the...

FACSIMILE : This is often known as 'fax' and it represents the interface between reprographic and computer technology. By using fax, the contents of a sheet of paper (text or illu

# real life business subsystem, Is production, marketing, personal, materia...

Is production, marketing, personal, material, finance are the real life business subsystems? if yes, then how?

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