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

K-Map is used to:

In Boolean algebra, A.A =

A Karnaugh map with 3 variables has:

Boolean Algebra was developed in the year:

Logic states can only be ___________or 0.

Which Boolean equation expressed the commutative law?

In Boolean algebra, A.1=

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

Who developed Boolean algebra?

In Boolean algebra, A + A =

Anything ANDed with 0 is equal to:

In which function is each term known as min term:

A Boolean function with four variables will have:

Anything ORed with 1 is equal to:

In Boolean algebra, A.A =

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

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

In which function is each term known as max term:

Boolean algebra has exactly the same structure as:

The OR operator of Boolean algebra is denoted by:

De Morgan’s Law states that:

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

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

The AND operator of Boolean algebra is denoted by

In Boolean algebra, A +0 =

In Boolean algebra, x̄̄

Boolean algebra is also known as:

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

In Boolean algebra, A + 1 =

In Boolean algebra, A + A =

In Boolean algebra, there are________________ possible variable value.