1. Could anyone tell me what Logic Function if all output are all high? (see Karnaugh Maps table below).
Thank you in advanced

 

hi paw,
As this is a College assignment, please post your attempt at solving the Map, we can then advise you.
E

 

A logic function that is true under all conditions? I believe you have found Universal Truth!

 

The map asks a basic question, the output state is dependent
on inputs. So what can you conclude in your example about the
dependency of the output on inputs ?


Regards, Dana.

 

hi paw,
As this is a College assignment, please post your attempt at solving the Map, we can then advise you.
E

i dont have answer for that, its the question i encountered during my exam, yet i do not have idea on how to answer

 

The map asks a basic question, the output state is dependent
on inputs. So what can you conclude in your example about the
dependency of the output on inputs ?


Regards, Dana.

regardless of what the input condition either high or low the output is high,
like the truth table below,

 

A logic function that is true under all conditions? I believe you have found Universal Truth!

wht logic function that can satisfy the truth table above?

 

What would pass a signal intact, unchanged ?

Regards, Dana.

 

I did this as a mental exercise in my early days of digital logic course.

Given a two input gate where X = f(A, B)
show the truth table of all possible functions one can create.

 

1. Could anyone tell me what Logic Function if all output are all high? (see Karnaugh Maps table below).
Thank you in advanced


View attachment 177870

Take a step back and look at logic functions of two inputs. There are sixteen possible functions and all of them have a name (many have multiple names). Some of them, such as AND and OR, translate well to more than two inputs. The one you are looking for also translates well. So look up the possible binary Boolean logic functions and see what that suggests.

 

(A | -A) & (B | -B)

then simplify.

Bob

 

(A | -A) & (B | -B)

then simplify.

Bob

Are you sure that it’s not

A | -A | B | -B​

?

 

Could be. Or any number of other tautologies.

Bob

 

The answer ought to be obvious.
I see 1s everywhere.
Do you see anything else that I might have missed?

Is it like this puzzle?
Find what's different.

 

Could be. Or any number of other tautologies.

Bob

Which is why that's the name!