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

Illustrate about the single inheritance, Illustrate about the single inheri...

Illustrate about the single inheritance During inheritance, superclass feature may by override by a subclass defining that feature with the same name. The overriding features (

Explain simplifying the sop boolean expression using k-map, Explain Simplif...

Explain Simplifying the SOP f the Boolean expression using the K-Map? To simplify the SOP of the Boolean expression using the K map, first identify all the input combinations tha

How can we use metropolitan area network, Q. How can we use Metropolitan Ar...

Q. How can we use Metropolitan Area Network? A MAN, essentially a bigger versions of a LAN is designed to extend over an entire city. It may be single network like a cable tele

Operations from events, Operations from events During analysis, events...

Operations from events During analysis, events which are sent to target objects. An operation on these object are presented as labels on transitions and should not be explicit

Difference between relocatable and self relocatable programs, Difference be...

Difference between relocatable and self relocatable programs. A relocatable program is one which can be processed to relocate it to a selected area of memory. For illustratio

State the relative addressing, State the Relative addressing The locati...

State the Relative addressing The location of data is specified relative to current value of the program counter. This is helpful for specifying location of data which is given

Convert ascii code to its bcd equivalent, Convert ASCII code to its BCD equ...

Convert ASCII code to its BCD equivalent. This can be achieved by simply replacing bits in upper four bits of byte by four zeros. For illustration the ASCII '1' is 32h = 0010B. By

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