9th Class MCQs Computer Science Chapter No.6 Old Course

The OR operator of Boolean algebra is denoted by:

In which function is each term known as min term:

Who developed Boolean algebra?

x(yz) = (xy)z is a representation of the:

In Boolean algebra, A.A =

In Boolean algebra, x̄̄

Boolean algebra is also known as:

Boolean algebra has exactly the same structure as:

De Morgan’s Law states that:

In Boolean algebra, there are________________ possible variable value.

K-Map is used to:

X+Y=Y+X  is a representation of the:

The idempotent law states that for two variables x and y:

In Boolean algebra, A + 1 =

A Boolean function with four variables will have:

In which function is each term known as max term:

In Boolean algebra, A.A =

Boolean Algebra was developed in the year:

Anything ORed with 1 is equal to:

In Boolean algebra, A +0 =

Which Boolean equation expressed the commutative law?

In Boolean algebra, A.1=

A Karnaugh map with 3 variables has:

In the Boolean equation x=A+B, the term A+B is generally read as

Logic states can only be ___________or 0.

The absorption law states that for two variables x and y:

The AND operator of Boolean algebra is denoted by

In Boolean algebra, A + A =

In Boolean algebra, A + A =

In the Boolean equation x=AB, the term AB is generally read as

Anything ANDed with 0 is equal to: