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

Explain working of counters, Q. Explain working of Counters? A counter ...

Q. Explain working of Counters? A counter is a register that goes through a predetermined sequence of states when clock pulse is applied. In principle value of counters is incr

Define buffering, Define buffering.  A buffer is a memory area that kee...

Define buffering.  A buffer is a memory area that keeps data while they are transferred among two devices or among a device and an application. Buffering is done for three reas

Hill climbing - artificial intelligence, Hill Climbing - Artificial Intelli...

Hill Climbing - Artificial Intelligence: As we've seen, in some problems, finding the search path from primary to goal state is the point of the exercise. In other problems, t

What is assembly, What is assembly Assemblies are the building blocks o...

What is assembly Assemblies are the building blocks of .NET Framework applications; they variety the fundamental unit of deployment, version control, reuse, activation scoping,

How can system improved when free lines are available, How can system impro...

How can system improved if one arrive at the probability of availability of free lines during the busy hour? Improvement can be made when the system is act as a loss system in

Floating point arithmetic pipelines, Floating point Arithmetic pipelines ...

Floating point Arithmetic pipelines Floating point computations are the finest candidates for pipelining. Take the instance of addition of two floating point numbers. Following

Use of parallel construct with private clause, Q. Use of parallel construct...

Q. Use of parallel construct with private clause? In this example we would see use of parallel construct with private and firstprivate clauses. At end of program i and j remain

What all 1's represents in 32bit ip addressing scheme, In 32bit IP Addressi...

In 32bit IP Addressing scheme all 1's represent? All 1's represent limited broadcast in 32 bit IP Addressing scheme.

Determine a positive logic system logic state level, In a positive logic sy...

In a positive logic system, logic state 1 corresponds to ? Ans. For positive digital logic, we choose two voltages levels. Higher voltage shows logic 1 and a lower voltage sho

Explain sr latch with nand gate, Explain SR Latch with NAND Gate? SR La...

Explain SR Latch with NAND Gate? SR Latch has two useful states: Set state, when output Q=1 and Q'=0. Reset state, when output Q=0 and Q'=1.Output Qand Q' are normally

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