Boolean algebra is crucial to everything in modern society! Without it we would have next to none of the technology we currently enoy!!
It's basically a way of dealing with information quickly by using very simple rules. By comparing small chunks of data in a certain way using lots of "things" (I'll come to what those things are shortly) you can quickly process the information you are putting in.
This is the basis behind the computer microchip. It is designed using millions of small electronic components called transistors, which each perform 1 boolean comparison. (other people have already mentioned what they are..true+true = true is the "And" boolean algebra function etc etc)
By putting these different functions in complex rows and series, data (digital on/off information transmitted as a varying current through the transistors. Binary data that is shown as either 1 or 0 making the comparisons pretty simple!) is channelled from one place to another in a very orderly, predicatable and repeatable fashion....and at great speed.
It's very hard to go into the more detail here...in fact computer processor design is massively complex, but this use of boolean is perhaps it's greatest achievement and practicle use today.
2007-10-08 11:23:06
·
answer #1
·
answered by Anonymous
·
0⤊
0⤋
Uses Of Boolean Algebra
2016-12-11 14:55:05
·
answer #2
·
answered by ? 4
·
0⤊
0⤋
From wikipedia: (The) theory of Boolean algebras has many practical applications in electrical engineering and computer science, as well as in mathematical logic.
Also, Boolean algebra finds its most practical use in the simplification of logic circuits. If we translate a logic circuit's function into symbolic (Boolean) form, and apply certain algebraic rules to the resulting equation to reduce the number of terms and/or arithmetic operations, the simplified equation may be translated back into circuit form for a logic circuit performing the same function with fewer components. If equivalent function may be achieved with fewer components, the result will be increased reliability and decreased cost of manufacture.
2007-10-08 10:17:22
·
answer #3
·
answered by pyaarmusafir 2
·
1⤊
1⤋
(boo´leen) , an abstract mathematical system primarily used in computer science and in expressing the relationships between sets (groups of objects or concepts). The notational system was developed by the English mathematician George Boole c.1850 to permit an algebraic manipulation of logical statements. Such manipulation can demonstrate whether or not a statement is true and show how a complicated statement can be rephrased in a simpler, more convenient form without changing its meaning. In his 1881 treatise, Symbolic Logic, the English logician and mathematician John Venn interpreted Boole's work and introduced a new method of diagramming Boole's notation; this was later refined by the English mathematician Charles Dodgson (better known as Lewis Carroll -this method is now know as the Venn diagram. When used in set theory, Boolean notation can demonstrate the relationship between groups, indicating what is in each set alone, what is jointly contained in both, and what is contained in neither. Boolean algebra is of significance in the study of information theory, the theory of probability, and the geometry of sets. The expression of electrical networks in Boolean notation has aided the development of switching theory and the design of computers.
2007-10-08 10:16:03
·
answer #4
·
answered by alser 2
·
1⤊
1⤋
Boolean logic is used all the time in computer programming, where you might have to deal with different "or" and "and" conditionals nested within each other. I test software for a living, and a lot of problems come down to an if/then sort of statement allowing something that it wasn't meant to.
2007-10-08 10:14:17
·
answer #5
·
answered by Anonymous
·
2⤊
0⤋
In Boolean algebra, you have authentic (T) and fake (F) inputs and outputs to applications. authentic could be T, a million or +V fake could be F, 0 or 0V evaluate each and every portion of a sequential circuit as a function. each and every function has its very own good judgment. you may carry out issues like AND, OR, no longer, XOR, NAND, NOR, and so on... as an occasion, your circuit has 2 inputs: enter a million is +5V, and enter 2 is floor 0V. +5V is a logical a million, floor is a logical 0. in the journey that your circuit is an person-friendly AND gate, you will possibly get a million and 0, it extremely is 0 and your output may be 0V. in the journey that your circuit is an person-friendly OR gate, you will possibly get a million OR 0, it extremely is a million and your output may be +5V. this could additionally selection reckoning on the form of gate used, and the components used interior the gate (some according to probability furnish a +V rather of a nil and a nil rather of a +5). as long as your circuit is consistent, and your algebra is authentic, your circuit will function wisely. In sequential circuits, this output is the enter to a distinctive portion of your circuit.
2016-10-21 12:03:26
·
answer #6
·
answered by ? 4
·
0⤊
0⤋
Boolean logic is often used in computer programming
2007-10-08 15:08:48
·
answer #7
·
answered by Aslan 6
·
0⤊
0⤋
Designing digital electronic circuits to implement a required function.
Elementary example: "start the winding motor if the lift door is closed and the overload switch is not activated and the up button is pressed or the call button on the top floor is pressed" becomes
M=C.(notL).(U+F) .
2007-10-08 10:23:12
·
answer #8
·
answered by James P 5
·
0⤊
1⤋
True and True = True
True and False = False
False and False = False
Fase and True = False
There is also OR, XOR, and other boolean gate operations.
2007-10-08 10:14:31
·
answer #9
·
answered by Axis Flip 3
·
1⤊
1⤋
Yes. You can earn a fortune as a computer programmer.
2007-10-08 10:42:04
·
answer #10
·
answered by Copper 4
·
0⤊
1⤋