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 are condition codes, What are condition codes? In many processors,...

What are condition codes? In many processors, the condition code flags are kept in the processor status register. They are either set are cleared by lots of instructions, so th

Dynamic address translation - computer architecture, Dynamic address transl...

Dynamic address translation :  If, when executing an instruction, a CPU fetches an instruction located at a specific virtual address, or fetches data from a particular virtual

Advantage and disadvantage of threaded binary trees, Advantage  1.     ...

Advantage  1.       By doing threading we neglect the recursive method of traversing a Tree , which makes use of stack and consumes many memory and time . 2.       The node

How do you get workflow automation in e-business environment, How do you ge...

How do you get workflow automation into e-business environment? In order to run smoothly, organizations frequently standardize processes across the organization and support use

First-order models -artificial intelligence, First-Order Models - Artificia...

First-Order Models - Artificial intelligence: We proposed first-order logic like good knowledge representation language rather than propositional logic because it is more expre

What kind of system do we need to run gimp, Any system able of run Gnome 2,...

Any system able of run Gnome 2, KDE 3.2, Windows 2000, Mac OS X and later versions should be capable to run GIMP. GIMP's biggest appetite is for memory and how much you will requir

Carry save addition and generated and propagate function, Explain carry sav...

Explain carry save addition (CSA) process. Ans: Instead of allowing the carries ripple along the rows, they can be saved and then introduced into the next roe at the right wei

What are the components of i-way infrastructure, What are the components of...

What are the components of I-way Infrastructure? There are three components of the I-way infrastructure: • Consumer access equipment • Local on-Ramps • Global informat

Explain creating files for writing only in c, Creating Files for Writing On...

Creating Files for Writing Only Creating Files for Writing Only : To create a text file for writing only, pass "w" into fopen as the second argument. This example follows along

Handlers classification, Handler's Classification In 1977, Wolfgang Han...

Handler's Classification In 1977, Wolfgang Handler proposed an detailed notation for expressing the parallelism and pipelining of computers. Handler's classification addresses

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