Draw logic circuit using 2-input NAND gates, Computer Engineering

A combinational circuit has 3 inputs A, B, C and output F.  F is true for following input combinations

  • A is False, B is True
  • A is False, C is True
  • A, B, C are False
  • A, B, C are True

Draw a Logic circuit by using minimum number of 2-input NAND gates.

Ans.

1095_Draw a Logic circuit of a combinational circuit.png

Diagram of a logic circuit of a combinational circuit having 2-input NAND gates.

Posted Date: 5/1/2013 8:04:35 AM | Location : United States







Related Discussions:- Draw logic circuit using 2-input NAND gates, Assignment Help, Ask Question on Draw logic circuit using 2-input NAND gates, Get Answer, Expert's Help, Draw logic circuit using 2-input NAND gates Discussions

Write discussion on Draw logic circuit using 2-input NAND gates
Your posts are moderated
Related Questions
Q. Explain types of assembly programs? Assembly language programs can be written in two manners: COM Program: Having all segments as part of one segment EXE Program: that hav

What is a disk drive? The electro mechanical mechanism that spins the disk and moves the read/write heads known as disk drive.

Find the Nyquist rate for the following signals: (a) x(t) = 5 sin 3000πt cos 4000πt (b) A binary channel with bit rate 36000 bps is available for PCM voice transmission. Fi

State the various Security Tools Securing an Intranet is not a simple task. Just as articles in a house are protected by use of various types of security systems such as lock

How do you populate data into a multiple line field? To populate data into a multiple line field, an index is added to the field name to show which line is to be populated by t

A sorting method which uses the binary tree concept such that label of any node is larger than all  the labels in the sub trees, is called A Sorting method which uses the binar

Why the temporary registers W and Z are named so I mean we start from A,B,C,D,E then H and L coz H stands for higher bit nd L for lower bit of the address pointed by memory pointer

Define deadlock? Deadlock is a condition, wherein processes never finish executing and system resources are tied up, preventing another job from beginning. A process requests r


The defining traits of an object-oriented language are: * Encapsulation * Inheritance * Polymorphism