Minimize the logic function using NAND gate, Computer Engineering

Assignment Help:

Minimize the logic function F(A, B, C, D) = ∑ m(1,3,5,8,9,11,15) + d(2,13) using NAND gate with help of K-map.

Ans. Realization of given expression by using NAND gates:

 In SOP form the minimized logic expression is F = A B‾ C‾ + C‾D + B‾D + AD, therefore the logic diagram for the simplified expression is shown in fig.

563_Minimize the logic function using NAND agte.png

Fig. Logic Diagram


Related Discussions:- Minimize the logic function using NAND gate

When recursion functions are declared inline, Describe what happens when re...

Describe what happens when recursion functions are declared inline? Ans) Inline functions property says whenever it will call; it will copy the whole definition of that functi

Explain about mmx architecture, Explain about MMX architecture MMX arc...

Explain about MMX architecture MMX architecture introduces new packed data types. Data types are eight packed, consecutive 8-bit bytes; four packed, consecutive 16-bit words;

User compatibility & appropriateness of inputs and outputs, User Compatibil...

User Compatibility & Appropriateness of Inputs and Outputs User compatibility - this is the degree to which the machine works towards task completion in way that suits the u

What is literal, Meaning of Literal is:- Literal is string constant.

Meaning of Literal is:- Literal is string constant.

What is computer virus, What is computer virus?  A  computer  virus  is...

What is computer virus?  A  computer  virus  is  a  computer  program  that  is  designed  to  spread  itself between   computers.   Computer virus are inactive when standing a

Explain about synchronous dram, Q. Explain about Synchronous DRAM? One ...

Q. Explain about Synchronous DRAM? One of the most broadly used forms of DRAM is synchronous DRAM (SDRAM). Unlike the conventional DRAM that is asynchronous SDRAM exchanges dat

Simplify the expressions by using boolean postulates, Simplify the given ex...

Simplify the given expressions using Boolean postulates Y = (A + B)(A‾ + C)(B + C) Ans. Y = (A + B)(A‾ + C)(B + C) = (A A‾ + AC + B A‾ + BC) (B + C) = (AC + B A‾ + BC) (B + C)

Specifying research problems, Specifying Research Problems: In our age...

Specifying Research Problems: In our agent terminology or in technique history, a problem to be solved is a specific and justified manner where the agent has starts with the b

State the process of development of object oriented analysis, The Process o...

The Process of Development The approach to development can be an iterative one. It involves repeated refinement of the object model. The process needs to be controlled by an a

A subroutine can be terminated unconditionally using exit, A subroutine can...

A subroutine can be terminated unconditionally using EXIT. True.

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