Understanding Boolean Logic
Boolean logic is just but one of the principles applied into or used by a computer for it to be able to think or perform a process. Most people only know that Bill Gates is the man behind the wonder machine but digging down to details would reveal that each individual principle has long been in existent. Boolean logic for example was developed in the 1840s by George Boole. It is an algebraic process of deduction that can yield results to either a “true” or a “false” value. It has been considered as one of the foundations of modern day computer and technology science. All computing or intellectual devices that we have today use such binary principle.
To explain in simple words, Boolean logic makes organizing concepts, thoughts, or ideas simpler by determining whether a parameter or condition is true or false. It allowed computers and electronic devices to think and arrive at the correct response or process even amidst the multitude of information stored in it or when simultaneous computing activities are ongoing. Thus, unlike us humans that respond to a query in a lengthy manner or explanation, Boolean logic are only concerned whether the answer is a yes or no.
How does it work?
boolean logic
It generally works by comparing individual bits. For those who are unfamiliar, bits are the smallest units of digital information. You might notice that all computer files have sizes that are generally expressed in bytes; each byte may further be divided into bits. Boolean logic performs its operation by comparing these individual bits of information. For example, if you are typing a word in Microsoft Word or notepad, hitting the letter “a” key would trigger the computer program to compare information stored in it (bits) and look for the appropriate letter. After a “true” value has been identified, it is then prompted on the screen. The Boolean logic process performed by a computer is very fast that you can see results instantly.
To determine the manner of comparing the bits of digital information, operators are used. The three operators are “AND”, “OR”, and “NOT”. Understanding how these three operators aid in Boolean logic should be simple. During bit comparison, if the process is searching for two or more specific bits, the “AND” operator is used. “OR” is used when either a particular bit or the other is being searched, and “NOT” when a particular bit (bits) should be excluded from the search or comparison.
Some common application examples
Searching the internet is one simple example. You type a word and the search engine or website will look across the internet and compare data (bits of information) and deliver results that will correspond to it. This uses Boolean Search.
Boolean logic is also part of the Microsoft Excel computing process. Remember the conditional functions =if () which uses operators (and, or, not) to search and compare data across the spreadsheet?