Define the boolean algebra, Computer Engineering

Assignment Help:

Define The Boolean algebra?

A set of rules invented by the English mathematician George Boole describe certain propositions whose outcome would be either true or false with regard to digital logic, these rules are used to describe circuits whose state can be either, 1 (true) or 0 (false).

The Boolean algebra is like any other mathematical systems defined with a set of elements, set of operators, and set of postulates/axioms. The Boolean algebra is used primarily by design engineers by using this system they are able to arrange logic gates to accomplish desired tasks. The Boolean algebra also enables the engineers to achieve the desired output by using the fewest number of logic gates. For the formal definition of the Boolean algebra E V Huntington introduced some postulates in 1904 .This is called as Huntington postulates.


Related Discussions:- Define the boolean algebra

In ldb what determines hierarchy of the tables, In LDB what determines hier...

In LDB what determines hierarchy of the tables? Structure

Electrochemistry and batteries, differentiate between concentration cells a...

differentiate between concentration cells and electrolytic cells with suitable examples?

What is store program control, What is store program control (SPC)?  I...

What is store program control (SPC)?  In  stored  program  control  systems,  a  set  of  instructions  or  program  to  the computer  is  stored  in  its  memory  and  instru

Explain rby and cmyk colour printing, Q. Explain RBY and CMYK colour Printi...

Q. Explain RBY and CMYK colour Printing? For good printing printers don't use RBY in place of that they use CMYK (Cyan instead of Blue, Magenta instead of Red, Yellow and a sep

Define peripheral, Define peripheral. Devices that are under the direct...

Define peripheral. Devices that are under the direct control of computer are said to be linked online. These devices are intended to read information into or out of the memory

Define deadlock with resource request and allocation graph, Define Deadlock...

Define Deadlock with Resource request and allocation graph (RRAG) Deadlocks can be described through a directed bipartite graph termed as a RRAG that is Resource Request All

Which 802 standard provides for a collision free protocol, Which 802 standa...

Which 802 standard provides for a collision free protocol? 802.5 standard gives for a collision free protocol.

Case x and z difference which is preferable and why, Case x, z difference, ...

Case x, z difference, which is preferable, why? CASEZ : Special version of case statement that uses a Z logic value to signify don't-care bits. CASEX : Special

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd