Simplify the expression by using karnaugh map, Computer Engineering

Assignment Help:

Simplify   the   following   expression   into   sum   of   products   using   Karnaugh   map

F(A, B, C, D) = ∑ (1,3,4,5,6,7,9,12,13)

Ans. Simplification of the given expression in sum of products using Karnaugh Map is shown below:

F(A,B,C,D) = Σ (1,3,4,5,6,7,9,12,13)

Karnaugh Map for F(A,B,C,D) = Σ (1,3,4,5,6,7,9,12,13) is demonstrated in figure (a). In this figure the grouping of cells is also shown.

819_Simplify   the   expression   into   sum   of   products   using   Karnaugh   map.png

So the equations for (1) is A‾ B; and for (2) is C‾ D; for (3) is A‾ D; for (4) is B C‾

Thus, the Simplified Expression for the Karnaugh map as
F(A,B,C,D) = A‾ B+ C‾ D+ A‾ D+B C‾
= A‾ (B + D) + C‾ ( B + D)

 

 


Related Discussions:- Simplify the expression by using karnaugh map

Hidden input, Yet another type of input is HIDDEN input. A HIDDEN in...

Yet another type of input is HIDDEN input. A HIDDEN input is a value/name pair which is returned to you but doesn

Explain the boolean equations for logic circuits, Explain The Boolean Equat...

Explain The Boolean Equations for Logic Circuits? A Boolean equation is the mathematical representation of a logic circuit using standard Boolean terms. All the logic gates (AND,

Data structure, Process: pid start time end time priority t...

Process: pid start time end time priority timeslice list of CPU bursts list of IO bursts (the number of IO burst will always be 1 less than the number of CPU

Integrating virtual memory, Integrating Virtual Memory, TLBs, and Caches - ...

Integrating Virtual Memory, TLBs, and Caches - computer architecture:   There are 3 types of misses: 1. a cache miss 2. TLB miss 3. a page fault 2 techniqu

Common tasks to accomplish - artificial intelligence, Common Tasks to Accom...

Common Tasks to Accomplish: Once you've worried about what and why you're doing "AI", what has inspired you and how you're going to approach the job, then you just start to th

Construct a shift register from S-R flip-flops, Construct a shift register ...

Construct a shift register from S-R flip-flops. Explain its working. Ans: S-R Flip-Flop Shift Register: Shift registers can be built through using SR flip-flops. Fig.(a)

Stack operation and interrupts in microprocessor, Let us review the operati...

Let us review the operation of the stack within the 68HC11, the stack is a defined area of RAM which is last in first out register (LIFO) . Access to the stack is made via a stack

Positive logic nand gate is equivalent to negative logic nor, Show that a p...

Show that a positive logic NAND gate is equivalent to negative logic NOR gate. Ans:  Positive logic denotes True or 1 with a high voltage and False or 0 with a low volt

What are qualified associations, What are qualified associations? A qua...

What are qualified associations? A qualified association is an association in which an attribute known as the qualifier disambiguates the object many associated end.

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