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

High level expertise, The most useful feature of an expert system is the h...

The most useful feature of an expert system is the high level expertise it provides to aid in problem solving. This expertise can represent the best thinking of the top

Differentiate between EPROM and EEPROM, Differentiate between EPROM and EEP...

Differentiate between EPROM and EEPROM. EPROM: The meaning of this term is Erasable PROM. This can be reprogrammed through first erasing the existing program. EPROM uses N-MO

The field sy-dynr, The field SY-DYNR refers to Number of the current sc...

The field SY-DYNR refers to Number of the current screen.

Node at the highest level in the structure, Node at the highest level in th...

Node at the highest level in the structure is known as?? Root.

Explain non-pre-emptive algorithms, Explain non-pre-emptive algorithms?   ...

Explain non-pre-emptive algorithms?   Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot

Define strategy procedure, Q. Define Strategy Procedure? The strategy p...

Q. Define Strategy Procedure? The strategy procedure is called when loaded into memory by DOS or whenever controlled device request service. The major purpose of the strategy i

What are the steps comprised in authentication, What are the steps comprise...

What are the steps comprised in authentication? Steps in Authentication: The control over the access of the resources within the repository is exercised in two steps tha

Variables and quantifiers for first-order models , Variables and Quantifier...

Variables and Quantifiers for First-order models -artificial intelligence: So what do sentences containing variables mean? In other words, how does first order model select whe

Explain about indirect addressing, Q. Explain about Indirect Addressing? ...

Q. Explain about Indirect Addressing? In this technique the operand field of instruction specifies the address of address of intended operand for example if instruction LOAD

And-introduction rule, And-Introduction: In generally English says tha...

And-Introduction: In generally English says that "if we know that a lot of things are true, so we know that the conjunction of all of them is true", then we can introduce conj

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