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 about annotational notations, Explain about Annotational Notations ...

Explain about Annotational Notations These notations may be applied to describe remark and illuminate about any element in the model. They are considered as explanatory of U

Design of structure chart, Design of structure chart - Standard qualit...

Design of structure chart - Standard quality structure charts result in programs that are modular, reusable and simple to execute. - Measures include: Cohesion

Discuss in detail about the computers and supercomputers, Discuss in detail...

Discuss in detail about the Computers and supercomputers Computers are classified with respect to their size, cost and speed as supercomputers, servers, embedded computers and

Explain types of micro-instructions, Q. Explain types of Micro-instructions...

Q. Explain types of Micro-instructions? In general micro-instruction can be classifiedin two general kinds. These are non-branching and branching. After execution of a non-bran

Simplify the boolean expression, Simplify the Boolean expression F = C(B + ...

Simplify the Boolean expression F = C(B + C)(A + B + C). Ans. Simplification of the given Boolean Expression F = C (B +C) (A+B+C) given as F = C (B+C) (A+B+C) = CB + CC [(A+B+C

Types of buses, different types of buses with diagram

different types of buses with diagram

What is the use of system.data.dlinq.dll, System.Data.DLinq.dll gives funct...

System.Data.DLinq.dll gives functionality to work with LINQ to SQL.

Computational study of a spring-mass system, Idealized spring-mass systems ...

Idealized spring-mass systems have numerous applications throughout engineering. Fig.1 shows an arrangement of three masses and four springs which, after is released, is pulled dow

First order predicate logic-artificial intelligence, First Order Predicate ...

First Order Predicate Logic This is a more expressive logic because it builds on propositional logic by allowing us to use constants, predicates, variables, quantifiers and fun

Origin of RISC, Q. Origin of RISC? In the 1980s a new philosophy develo...

Q. Origin of RISC? In the 1980s a new philosophy developed having optimizing compilers which could be used to compile 'normal' programming languages down to instructions which

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