Question

hw to draw truth table to boolean expressions of AND,Or,Not gater computerscience class 9 explain it fully​

Answer 1

Answer:

for and gate there is the addition so we add the binary numers

Explanation:

eg

X. Y. X+Y.

0. 0. 0

0. 1. 1

1. 0. 1

1. 1. 1

we can do from this can do this for other gate in or gate we put complement that is reverse of the answer and in the not gate we multiply the same thing just do in ad gate.