12th Computer Science CBSE JAC

Applications of Boolean Algebra in Computer Science

Applications of Boolean Algebra
Written by AIPS

In this topic we will discuss best concepts of Applications of Boolean Algebra in Computer Science . let’s begin.

Boolean Algebra is used to analyze and simplify the digital(logic) Circuits. In the design of the logic circuits, Boolean Algebra and Logic gates play an important role. The logic circuits are used to design various types of Registers in computers. Different types of registers perform different types of tasks

There are following main types registers.

  • Adders
    • Half Adder
    • Full Adder
  • Encoders
  • Decoders
  • Binary Adders

Adders

An adder is a digital or logic circuit that performs addition of bits or numbers.Adders can be constructed for many number representation

Half Adder

A Half adder is a logic circuit that performs the addition of two bits and produces SUM and CARRY.

SUM=A’B+AB’

CARRY= A.B

ABCARRYSUM
0000
0101
1001
1110
Truth Table for Half Adder

Full Adder

A full adder is a logic circuit that performs the addition of three bits and produces SUM and CARRY.

SUM= A’B’C+A’BC’+AB’C’+ABC

CARRY= AB+BC+AC

ABCCARRYSUM
00000
00101
01001
01110
10001
10110
11010
11111
Truth Table for Full adder

Encoders

An encoder is a logic circuits that converts data of Decimal form in to Binary Form. An Encoder takes 2 powers n input and n output lines. It encodes decimal , octal, hexadecimal forms to binary form.

Decoders

A decoder is a logic circuit that converts data of binary form into decimal form. A decoder of n inputs is capable of representing up to 2 the power n outputs.

To be continued… Please check daily for more updates..

Also Read Best concept :

About the author

AIPS

Leave a Comment