Thread: Boolean eqn from table ques.

Hi everyone,

Can someone help me with this..I dont know where to start.


Write the Boolean Equation that corresponds to the Truth Table as below:

A B C Z
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1

1 1 1 0

Pls help guide and advise...tq so much,really appreciate it.

Tq & rgds.

Hello anderson!

Originally Posted by anderson

Hi everyone,

Can someone help me with this..I dont know where to start.


Write the Boolean Equation that corresponds to the Truth Table as below:

A B C Z
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1

1 1 1 0

Pls help guide and advise...tq so much,really appreciate it.

Tq & rgds.

I assume Z represents the result?

First of all i considered

0 0 0 => 1
and
1 1 1 => 0

So I thought at neq(A and B and C) = neq (0) = 1
and neq(A and B and C) = neq(1) = 0

The second line says

0 0 1 => 0.

neq(A and B and C ) = neq(0 and 0 and 1) = neq(0) = 1

That is wrong already. So i modified the guess to neq((A and B) or C)
In this case it is neq((0 and 0) or1) = neq(1) = 0

neq((A and B) or C) solves the tableau, iff Z is the result.

In this case it is much easier, because neq(C) would solve the table as well. But that seems too easy. What does Z mean?

Yours
Rapha

Hi Rapha/everyone

Sorry, Z is the output/result.


Thank you for all your help & support...pls help me im stuck.

Tq & rgds

Hey!

Originally Posted by anderson

Hi Rapha/everyone

Sorry, Z is the output/result.

Okay

Originally Posted by anderson

Thank you for all your help & support...pls help me im stuck.

Tq & rgds

What exactly is the question?
Furthermore are you sure there is no typo in your table?

You wrote

A B C Z
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1

1 1 1 0

Lets consider the C-column and the Z-column:

C Z
0 1
1 0
0 1
1 0
0 1
1 0
0 1
1 0

Thus the boolean equation for Z is ¬ (it is the negation of C.)
Negation of 1 is 0
Negation of 0 is 1

You don't even need the A-terms or the B-terms in your bool equation.

kind regards
Rapha

Hi everyone
Here is the question:

Write the Boolean Equation that corresponds to the Truth Table as below:

A B C Z
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1

1 1 1 0

pls help me...tq so much for all your comments & guidance,really appreciate it.

Hello anderson!

Originally Posted by anderson

Hi everyone
Here is the question:

Write the Boolean Equation that corresponds to the Truth Table as below:

A B C Z
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1

1 1 1 0

pls help me...tq so much for all your comments & guidance,really appreciate it.

What is wrong with ¬C ? It is possible that you prefer C' or instead of ¬C.

Hi Rapha

i wanted the answer using K-mapping technique....ur answer is also correct.tq..

Tq & rgds

Hey!

Originally Posted by anderson

Hi Rapha

i wanted the answer using K-mapping technique

I'm sorry, because I didn't know that.
If you still want to find the solution by using K-mapping technique click this
Karnaugh Maps

I think Table 1-17 and Table 1-18 are very helpful.And it is very similar to your problem.

Kind regards
Rapha

Hi Rapha/everyone,

This is the full answer:

By summing the minterms of output which is high
Z = m₀ + m₂ + m₄ + m₆
Z=A’B’C’ + A’BC+AB’C’+ABC’

Simplifying the equation:
Z=A’C’(B’+B)+AC’(B’+B)
=A’C’+AC’
=C’(A’+A)
=C’
[
thank everyone for your help & advise...

Hello, anderson!

Is it as simple as I think it is?

Write the Boolean Equation that corresponds to the Truth Table below:

. .

The -values are the opposite of the -values.
. . (The - and -values are irrelevant.)

The equation would be: .

Hi everyone

The question wanted the root equation before it is simplified as well.The root equation can be derived from the table using minterms.

thank you to everyone for responding,really appreciate all your help & support.

Tq & rgds