Boolean Operators Boolean Operators Most search tools offer some type of Boolean search option as a way of constructing your research question, and indicating the relationships between your search terms. There are three common Boolean operators: AND, OR, NOT (it's best to capitalize Boolean operators because some search tools require it). OR is used to join synonymous or related terms, and instructs the search tool to retrieve any record that contains either (or both) of the terms, thus broadening your search results. The OR operator is particularly useful when you are unsure of the words used to categorize your topic or if information on your topic is even available. If you are retrieving too few records, broaden your search by adding a synonym with the Boolean Operator OR. Know More About Area Of Square Calculator
Page No. : 1/4
AND is used to join words or phrases when both (or all) the terms must appear in the items you retrieve. This search query would return a much smaller set of records, and the items found would be more specific to your research question. If you are retrieving too many records, try adding another search term with the Boolean Operator AND. NOT is used to exclude a particular word or combination of words from your search results. If you are retrieving many records that are unrelated to your topic, try using the NOT operator to eliminate a word. This should be done cautiously, because as well as deleting the unwanted items, such a search will also eliminate records that discuss both the relevant topic as well as the unrelated topic. Boolean functions in applications A Boolean function describes how to determine a Boolean value output based on some logical calculation from Boolean inputs. Such functions play a basic role in questions of complexity theory as well as the design of circuits and chips for digital computers. The properties of Boolean functions play a critical role in cryptography, particularly in the design of symmetric key algorithms (see substitution box). Read More About Area Of Polygon In Coordinate Geometry
Page No. : 2/4
Boolean functions are often represented by sentences in propositional logic, and sometimes as multivariate polynomials over GF(2), but more efficient representations are binary decision diagrams (BDD), negation normal forms, and propositional directed acyclic graphs (PDAG). In cooperative game theory, monotone Boolean functions are called simple games (voting games); this notion is applied to solve problems in social choice theory.
Page No. : 2/3 Page No. : 3/4
Thank You For Watching