Boolean Algebra | MCQs

Explanation

A Karnaugh map (K-map) is a visual method for simplifying Boolean expressions.

It consists of square boxes called cells, each representing a minterm (combination of variable values).

Explanation

There are 7 basic logic gates:

1. AND
2. OR
3. NOT
4. NAND
5. NOR
6. XOR
7. XNOR

These gates form the foundation of digital electronics and computing.

Explanation

The Karnaugh map (K-map) method was introduced by Maurice Karnaugh in 1953.

It is used for simplifying Boolean algebra expressions visually.

Explanation

A NAND gate gives output 0 only when all inputs are 1; otherwise, it outputs 1.

It is the inverse (NOT) of the AND gate.

Explanation

In Karnaugh Maps, 1's are grouped in powers of two (1, 2, 4, 8, etc.) horizontally or vertically to simplify Boolean expressions.

The goal is to minimize the number of terms by forming the largest possible groups of adjacent 1's.

Explanation

The AND gate performs logical multiplication, outputting 1 only when all its inputs are 1.

It is also known as a conjunction gate in digital logic.

Explanation

• Boolean refers to a logical data type that can have only two possible values: True or False.
• This means that a Boolean set has only 2 elements.
  

Explanation

Different logic gates are AND,OR , NOT, NAND, NOR.

logic gates are elementary  building block of digital circuit.

Most of logic gates have two input and one output.