Logo
Search
Search
View menu

Boolean Algebra

Presentations | English

Boolean algebra is a branch of mathematics that deals with operations on logical values with binary variables. The Boolean variables are represented as binary numbers to represent truths: 1 = true and 0 = false. Elementary algebra deals with numerical operations whereas Boolean algebra deals with logistical operations. Boolean algebra has been used to come up with an analysis of flight accidents. Other systems that have applied Boolean algebra are search engines. Search engines such as Google and duckduckgo use Boolean algebra to enable the users to get data whenever they request or search. Boolean Algebra is used to analyse and simplify the digital (logic) circuits. It uses only the binary numbers i.e. 0 and 1. It is also called as Binary Algebra or logical Algebra. Boolean algebra was invented by George Boole in 1854. Boolean logic is especially important for computer science because it fits nicely with the binary numbering system, in which each bit has a value of either 1 or 0.

Picture of the product
Lumens

11.00

Lumens

PPTX (22 Slides)

Boolean Algebra

Presentations | English