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

Security, We now consider the relation between passwords and key size. For ...

We now consider the relation between passwords and key size. For this purpose consider a cryptosystem where the user enters a key in the form of a password. Assume a password consi

Difficulties - canonical genetic algorithm, Difficulties - canonical geneti...

Difficulties - canonical genetic algorithm: Therefore the first big problem we face whether designing an "AI" agent to perform a GA-style search is how to represent the soluti

Explain parsing, What is parsing? The target of parsing is to find out...

What is parsing? The target of parsing is to find out the syntactic validity of a source string. A tree is built for use through subsequent phase of compiler, if the string is

Btree, What should the size of ''t'' in btree be depending on the hard disk...

What should the size of ''t'' in btree be depending on the hard disk size

Computer arcticture, what is the main goal of parallel processing

what is the main goal of parallel processing

Derive the expression of traffic capacity, Traffic Capacity is given by? ...

Traffic Capacity is given by? Traffic Capacity = Switching capacity × Theoretical maximum load.

Define asynchronous bus, Define asynchronous bus. Asynchronous buses ar...

Define asynchronous bus. Asynchronous buses are the ones in which every item being transferred is accompanied by a control signal that shows its presence to the destination uni

Which of the memory is volatile memory, Which of the memory is volatile mem...

Which of the memory is volatile memory ? Ans. A volatile memory is RAM. Term Volatile memory implies the contents of the RAM get erased as soon as the power goes off.

Perform multiplication with showing content of accumulator, Perform multipl...

Perform multiplication with showing the contents of accumulator, B register and Y register during each step. (Accumulator, B, Y are 4-bit registers) B=06 Y=02

Input output techniques - computer architecture, Input Output Techniques: ...

Input Output Techniques: o   Interrupt driven o   Direct Memory Access (DMA) o   Programmed Programmed I/O   CPU has control over I/O directly   Read/write

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