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

What is a development class, What is a Development class? Related obje...

What is a Development class? Related objects from the ABAP/4 repository are assigned to the similar development class.  This enables you to right and transport related objects

Microprocessor, overlapping segmentation process in 8086

overlapping segmentation process in 8086

Discuss about second generation electronic computers, Second Generation (19...

Second Generation (1954-1962) The second generation saw various significant developments at every level of computer system design, from technology used to build the basic circu

Explain non-pre-emptive algorithms, Explain non-pre-emptive algorithms?   ...

Explain non-pre-emptive algorithms?   Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot

What are the event key words in interactive reporting, What are the event k...

What are the event key words in interactive reporting? Event Keyword                                                 Event AT LINE-SELECTION         Moment at which the u

Explain recursive descent parsing, Explain Recursive Descent Parsing It...

Explain Recursive Descent Parsing It is a top down parsing with no backtracking. This parsing method uses a set of recursive processes to perform parsing. Most important advant

Explain difference between security and protection, Explain difference betw...

Explain difference between Security and Protection? Protection mechanism: The subsequent mechanisms are commonly utilized for protecting files having programs and data. (a

Illustrate the text area, specifies a form field where user can enter large...

specifies a form field where user can enter large amounts of text. In most respects, works like an field. It can have a name as well as a def

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