T
Tom Biasi
Guest
On 12/8/2014 2:46 AM, Tim Wescott wrote:
On Sun, 07 Dec 2014 21:17:49 -0800, jsscshaw88 wrote:
Hi,
Questions 1 :
How can you use K-Map for 3 to 8 line decoder? The truth table is as
folllows
a b c o1 o2 o3 o4 o5 o6 o7 o8 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0
1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 1 0 0 0 0 1 0
0 0 0 0 0 1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 1 0 0
0 1 1 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 0 0 1
I know that I can make the boolean equation from the Truth table and can
make the decoder circuit using 8 an gates and some inverters? But how
can do this using K map. Is it possible to do a K map? Because there are
8 out puts not one!
Question 2: If you are allowed to use just one NAND gate then, how many
ways can you come up with an inverter?
I know atleast two ways to solve this problem. I can tie the two inouts
of the NAND gate together or tie one input to ground permanently.
But my problem is that how can use K map to solve this problem.
If I use K map then I come up with the followng equation
A' + B' = Y
Can I solve this problem using K map?
jess
Will the answer still be valuable after finals week?
They're so obvious aren't they?