Write the truth table to realize the function nand gate, Computer Engineering

Assignment Help:

For F = A.B.C + B.C.D‾ + A‾.B.C, write  the  truth  table to realize the function using NAND gates only ?

Ans. Logic Function given as F = ABC + BC‾D + A‾BC, simplification of this expession isgiven below:

(i)The Truth Table is specified in Table

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

(iii) The NAND-NAND Realization is represented in fig.(b)

                                      187_Write  the  truth  table to realize the function NAND gate.png


Related Discussions:- Write the truth table to realize the function nand gate

Average access time experienced by the processor, Give the formula for the ...

Give the formula for the average access time experienced by the processor in a system with 2 levels of caches. Ans: Formula is for the average access time experienced by the pr

Is tcp connection-oriented?, Q. Is tcp Connection-oriented? TCP is conn...

Q. Is tcp Connection-oriented? TCP is connection-oriented. This means a connection is established between source and destination machines before any data is sent it implies tha

Determine the complete or gate and and gate decoder, Q. Determine the comp...

Q. Determine the complete OR gate and AND gate decoder count for an IC memory with 4096 words of 1 bit each, using the Linear select memory organization and Two dimensional Memory

Overfitted the data, Overfitted the data: Moreover notice that as time...

Overfitted the data: Moreover notice that as time permitting it is worth giving the training algorithm the benefit of the doubt as more as possible. However that is, the error

Explain difference between scanning and parsing, Explain difference between...

Explain difference between Scanning and parsing. Scanning and parsing: Scanning process is the process of recognizing the lexical components in a source string whereas parsin

Node at the highest level in the structure, Node at the highest level in th...

Node at the highest level in the structure is known as?? Root.

What is link destruction, What is link destruction? Link destruction is...

What is link destruction? Link destruction is inverse of link creation. When a link is destroyed makes sure the associated objects accessible by other handles or intentionally

Exponential search, Exponential Search Another alternative to variable ...

Exponential Search Another alternative to variable size decrease-and-conquer search is known as exponential search. This algorithm begins searching at the beginning of the list

Various threats posed by server in client server environment, Explain vario...

Explain various threats posed through servers into a client server environment. Server Destroyed within an Accident: Power failures, Leaking pipes and equipment failures are no

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