Free Essay

Boolean Operator

In:

Submitted By zxiang1
Words 2282
Pages 10
In logic, a logical connective (also called a logical operator) is a symbol or word used to connect two or more sentences (of either a formal or a natural language) in a grammatically valid way, such that the sense of the compound sentence produced depends only on the original sentences.

The most common logical connectives are binary connectives (also called dyadic connectives) which join two sentences which can be thought of as the function's operands. Also commonly, negation is considered to be a unary connective.

Logical connectives along with quantifiers are the two main types of logical constants used in formal systems such as propositional logic and predicate logic. Semantics of a logical connective is often, but not always, presented as a truth function.

A logical connective is similar to but not equivalent to a conditional operator. [1]

Contents [hide]
1 In language
1.1 Natural language
1.2 Formal languages
2 Common logical connectives
2.1 List of common logical connectives
2.2 History of notations
2.3 Redundancy
3 Properties
4 Order of precedence
5 Computer science
6 See also
7 Notes
8 References
9 Further reading
10 External links
In language[edit]
Natural language[edit]
In the grammar of natural languages two sentences may be joined by a grammatical conjunction to form a grammatically compound sentence. Some but not all such grammatical conjunctions are truth functions. For example, consider the following sentences:

A: Jack went up the hill.
B: Jill went up the hill.
C: Jack went up the hill and Jill went up the hill.
D: Jack went up the hill so Jill went up the hill.
The words and and so are grammatical conjunctions joining the sentences (A) and (B) to form the compound sentences (C) and (D). The and in (C) is a logical connective, since the truth of (C) is completely determined by (A) and (B): it would make no sense to affirm (A) and (B) but deny (C). However, so in (D) is not a logical connective, since it would be quite reasonable to affirm (A) and (B) but deny (D): perhaps, after all, Jill went up the hill to fetch a pail of water, not because Jack had gone up the hill at all.

Various English words and word pairs express logical connectives, and some of them are synonymous. Examples (with the name of the relationship in parentheses) are:

"and" (conjunction)
"and then" (conjunction)
"and then within" (conjunction)
"or" (disjunction)
"either...or" (exclusive disjunction)
"implies" (implication)
"if...then" (implication)
"if and only if" (equivalence)
"only if" (implication)
"just in case" (biconditional)
"but" (conjunction)
"however" (conjunction)
"not both" (alternative denial)
"neither...nor" (joint denial)
The word "not" (negation) and the phrases "it is false that" (negation) and "it is not the case that" (negation) also express a logical connective – even though they are applied to a single statement, and do not connect two statements.

Formal languages[edit]
In formal languages, truth functions are represented by unambiguous symbols. These symbols are called "logical connectives", "logical operators", "propositional operators", or, in classical logic, "truth-functional connectives". See well-formed formula for the rules which allow new well-formed formulas to be constructed by joining other well-formed formulas using truth-functional connectives.

Logical connectives can be used to link more than two statements, so one can speak about "n-ary logical connective".

Common logical connectives[edit]
Name / Symbol Truth table Venn diagram P = 0 1
Truth/Tautology ⊤ 1 1 Venn11.svg
Proposition P 0 1 Venn01.svg
False/Contradiction ⊥ 0 0 Venn00.svg
Negation ¬ 1 0 Venn10.svg
Binary connectives P = 0 0 1 1 Q = 0 1 0 1
Conjunction ∧ 0 0 0 1 Venn0001.svg
Alternative denial ↑ 1 1 1 0 Venn1110.svg
Disjunction ∨ 0 1 1 1 Venn0111.svg
Joint denial ↓ 1 0 0 0 Venn1000.svg
Material conditional → 1 1 0 1 Venn1011.svg
Exclusive or \nleftrightarrow 0 1 1 0 Venn0110.svg
Biconditional ↔ 1 0 0 1 Venn1001.svg
Converse implication ← 1 0 1 1 Venn1101.svg
Proposition P 0 0 1 1 Venn0101.svg
Proposition Q 0 1 0 1 Venn0011.svg
More information
List of common logical connectives[edit]
Commonly used logical connectives include

Negation (not): ¬ , Np, ~
Conjunction (and): \wedge , Kpq, & , ∙
Disjunction (or): \or, Apq
Material implication (if...then): \rightarrow , Cpq, \Rightarrow , \supset
Biconditional (if and only if): \leftrightarrow , Epq, \equiv , =
Alternative names for biconditional are "iff", "xnor" and "bi-implication".

For example, the meaning of the statements it is raining and I am indoors is transformed when the two are combined with logical connectives:

It is not raining (¬P)
It is raining and I am indoors (P \wedge Q)
It is raining or I am indoors (P \or Q)
If it is raining, then I am indoors (P \rightarrow Q)
If I am indoors, then it is raining (Q \rightarrow P)
I am indoors if and only if it is raining (P \leftrightarrow Q)
For statement P = It is raining and Q = I am indoors.

It is also common to consider the always true formula and the always false formula to be connective:

True formula (⊤, 1, Vpq, or T)
False formula (⊥, 0, Opq, or F)
History of notations[edit]
Negation: the symbol ¬ appeared in Heyting in 1929.[2][3] (compare to Frege's symbol Begriffsschrift connective1.svg in his Begriffsschrift); the symbol ~ appeared in Russell in 1908;[4] an alternative notation is to add an horizontal line on top of the formula, as in \overline{P}; another alternative notation is to use a prime symbol as in P'.
Conjunction: the symbol ∧ appeared in Heyting in 1929[2] (compare to Peano's use of the set-theoretic notation of intersection ∩[5]); & appeared at least in Schönfinkel in 1924;[6] . comes from Boole's interpretation of logic as an elementary algebra.
Disjunction: the symbol ∨ appeared in Russell in 1908[4] (compare to Peano's use of the set-theoretic notation of union ∪); the symbol + is also used, in spite of the ambiguity coming from the fact that the + of ordinary elementary algebra is an exclusive or when interpreted logically in a two-element ring; punctually in the history a + together with a dot in the lower right corner has been used by Peirce,[7]
Implication: the symbol → can be seen in Hilbert in 1917;[8] ⊃ was used by Russell in 1908[4] (compare to Peano's inverted C notation); \Rightarrow was used in Vax.[9]
Biconditional: the symbol ≡ was used at least by Russell in 1908;[4] ↔ was used at least by Tarski in 1940;[10] ⇔ was used in Vax; other symbols appeared punctually in the history such as ⊃⊂ in Gentzen,[11] ~ in Schönfinkel[6] or ⊂⊃ in Chazal.[12]
True: the symbol 1 comes from Boole's interpretation of logic as an elementary algebra over the two-element Boolean algebra; other notations include \bigwedge to be found in Peano.
False: the symbol 0 comes also from Boole's interpretation of logic as a ring; other notations include \bigvee to be found in Peano.
Some authors used letters for connectives at some time of the history: u. for conjunction (German's "und" for "and") and o. for disjunction (German's "oder" for "or") in earlier works by Hilbert (1904); Np for negation, Kpq for conjunction, Apq for disjunction, Cpq for implication, Epq for biconditional in Łukasiewicz (1929).[13]

Redundancy[edit]
Such logical connective as converse implication ← is actually the same as material conditional with swapped arguments, so the symbol for converse implication is redundant. In some logical calculi (notably, in classical logic) certain essentially different compound statements are logically equivalent. A less trivial example of a redundancy is the classical equivalence between ¬P ∨ Q and P → Q. Therefore, a classical-based logical system does not need the conditional operator "→" if "¬" (not) and "∨" (or) are already in use, or may use the "→" only as a syntactic sugar for a compound having one negation and one disjunction.

There are sixteen Boolean functions associating the input truth values P and Q with four-digit binary outputs. These correspond to possible choices of binary logical connectives for classical logic. Different implementation of classical logic can choose different functionally complete subsets of connectives.

One approach is to choose a minimal set, and define other connectives by some logical form, like in the example with material conditional above. The following are the minimal functionally complete sets of operators in classical logic whose arities do not exceed 2:

One element
{↑}, {↓}.
Two elements
{\vee, ¬}, {\wedge, ¬}, {→, ¬}, {←, ¬}, {→, \bot}, {←, \bot}, {→, \nleftrightarrow}, {←, \nleftrightarrow}, {→, \nrightarrow}, {→, \nleftarrow}, {←, \nrightarrow}, {←, \nleftarrow}, {\nrightarrow, ¬}, {\nleftarrow, ¬}, {\nrightarrow, \top}, {\nleftarrow, \top}, {\nrightarrow, \leftrightarrow}, {\nleftarrow, \leftrightarrow}.
Three elements
{\lor, \leftrightarrow, \bot}, {\lor, \leftrightarrow, \nleftrightarrow}, {\lor, \nleftrightarrow, \top}, {\land, \leftrightarrow, \bot}, {\land, \leftrightarrow, \nleftrightarrow}, {\land, \nleftrightarrow, \top}.
See more details about functional completeness in classical logic at Functional completeness in truth function.

Another approach is to use on equal rights connectives of a certain convenient and functionally complete, but not minimal set. This approach requires more propositional axioms and each equivalence between logical forms must be either an axiom or provable as a theorem.

But intuitionistic logic has the situation more complicated. Of its five connectives {∧, ∨, →, ¬, ⊥} only negation ¬ has to be reduced to other connectives (see details). Neither of conjunction, disjunction and material conditional has an equivalent form constructed of other four logical connectives.

Properties[edit]
Some logical connectives possess properties which may be expressed in the theorems containing the connective. Some of those properties that a logical connective may have are:

Associativity: Within an expression containing two or more of the same associative connectives in a row, the order of the operations does not matter as long as the sequence of the operands is not changed.
Commutativity: The operands of the connective may be swapped preserving logical equivalence to the original expression.
Distributivity: A connective denoted by · distributes over another connective denoted by +, if a · (b + c) = (a · b) + (a · c) for all operands a, b, c.
Idempotence: Whenever the operands of the operation are the same, the compound is logically equivalent to the operand.
Absorption: A pair of connectives \land, \lor satisfies the absorption law if a\land(a\lor b)=a for all operands a, b.
Monotonicity: If f(a1, ..., an) ≤ f(b1, ..., bn) for all a1, ..., an, b1, ..., bn ∈ {0,1} such that a1 ≤ b1, a2 ≤ b2, ..., an ≤ bn. E.g., \vee, \wedge, \top, \bot.
Affinity: Each variable always makes a difference in the truth-value of the operation or it never makes a difference. E.g., \neg, \leftrightarrow, \nleftrightarrow, \top, \bot.
Duality: To read the truth-value assignments for the operation from top to bottom on its truth table is the same as taking the complement of reading the table of the same or another connective from bottom to top. Without resorting to truth tables it may be formulated as g̃(¬a1, ..., ¬an) = ¬g(a1, ..., an). E.g., \neg.
Truth-preserving: The compound all those argument are tautologies is a tautology itself. E.g., \vee, \wedge, \top, \rightarrow, \leftrightarrow, ⊂. (see validity)
Falsehood-preserving: The compound all those argument are contradictions is a contradiction itself. E.g., \vee, \wedge, \nleftrightarrow, \bot, ⊄, ⊅. (see validity)
Involutivity (for unary connectives): f(f(a)) = a. E.g. negation in classical logic.
For classical and intuitionistic logic, the "=" symbol means that corresponding implications "…→…" and "…←…" for logical compounds can be both proved as theorems, and the "≤" symbol means that "…→…" for logical compounds is a consequence of corresponding "…→…" connectives for propositional variables. Some many-valued logics may have incompatible definitions of equivalence and order (entailment).

Both conjunction and disjunction are associative, commutative and idempotent in classical logic, most varieties of many-valued logic and intuitionistic logic. The same is true about distributivity of conjunction over disjunction and disjunction over conjunction, as well as for the absorption law.

In classical logic and some varieties of many-valued logic, conjunction and disjunction are dual, and negation is self-dual, the latter is also self-dual in intuitionistic logic.

[icon] This section requires expansion. (March 2012)
Order of precedence[edit]
As a way of reducing the number of necessary parentheses, one may introduce precedence rules: \neg has higher precedence than \wedge, \wedge higher than \vee, and \vee higher than \rightarrow. So for example, P \vee Q \wedge{\neg R} \rightarrow S is short for (P \vee (Q \wedge (\neg R))) \rightarrow S.

Here is a table that shows a commonly used precedence of logical operators.[14]

Operator Precedence
\neg 1
\wedge 2
\vee 3
\rightarrow 4
\leftrightarrow 5
However not all authors use the same order; for instance, an ordering in which disjunction is lower precedence than implication or bi-implication has also been used.[15] The order of precedence determines which connective is the "main connective" when interpreting a non-atomic formula.

Computer science[edit]
[icon] This section requires expansion. (March 2012)
A truth-functional approach to logical operators is implemented as logic gates in digital circuits. Practically all digital circuits (the major exception is DRAM) are built up from NAND, NOR, NOT, and transmission gates; see more details in Truth function in computer science. Logical operators over bit vectors (corresponding to finite Boolean algebras) are bitwise operations.

But not every usage of a logical connective in computer programming has a Boolean semantic. For example, lazy evaluation is sometimes implemented for P ∧ Q and P ∨ Q, so these connectives are not commutative if some of expressions P, Q has side effects. Also, a conditional, which in some sense corresponds to the material conditional connective, is essentially non-Boolean because for if (P) then Q; the consequent Q is not executed if the antecedent P is false (although a compound as a whole is successful ≈ "true" in such case). This is closer to intuitionist and constructivist views on the material conditional, rather than to classical logic's ones.

Similar Documents

Free Essay

Programming Final

...Programming Final 1. The case structure lets the value of a variable or an expression determine which path of execution the program will take. It’s a multiple alternative decision structure that allows you to test the value of a variable or an expression and then use that value to determin which statement to execute. 2. The AND operator takes two Boolean expressions as operands and creates a compound Boolean expression that is true only when both expressions are true. True AND True = True 3. The OR operator takes two Boolean expressions as operands and creates a compound Boolean expression that is true when either of the sub expressions is true. True OR False = True 4. The NOT operator is a unary operator that takes a Boolean expression as its operand an reverses its logical value. The Not operator reverses the truth of its operand. If it is applied to an expression that is true the operator returns false. If it is applied to an expression that is false it returns True. Not true = False, Not false = True 5. Flow chart 6. And, Or , Not 7. And, Or, Not 8. And, OR, Not 9. > greater than, < less than, >= greater than or equal to, <= less than or equal to, == equal to, != not equal to 10. Case structure has a diamond at the top and branches down into different parallelograms. 11. A repetition structure causes a statement or set of statements to execute repeatedly. 12. A condition-controlled loop uses a true/false condition to control the number of times that...

Words: 991 - Pages: 4

Free Essay

Boolean Logic

...UNDERSTANDING BOOLEAN LOGIC AND ITS APPLICATIONS In the 1800’s (1815-1864), George Boole, a English mathematician who did extensive work in the subject of logic, invented a system of mathematics in which the abstract concepts of true and false can be used in computations. In an attempt to create a new form of mathematics, Mr. Boole identified certain patterns of logic that were later found to be easily translated into an electronic language—essentially, a "switchon/switchoff" pattern. Today, using tiny electronic switching mechanisms inside the computer, "decisions" are made with lightning speed within the central processing unit (CPU). These decisions are based on whether a tiny switch is on or off at any given time. Computer programmers follow prescribed sets of instructions to "teach" computers how to make decisions to carry out instructions. Programming is made possible by sets of instructions called languages. Many of these languages are made up of the logic building blocks identified by Mr. Boole more than 100 years ago, long before computers. The building blocks that Mr. Boole identified are AND logic, OR logic, NOT logic, NAND logic, and NOR logic. Computer decisions are made from these patterns of logic. All programming languages allow you to create expressions that can be evaluated as either true or false, which are called Boolean expressions. A Boolean condition is a conditional statement containing a Boolean expression, and another name for a conditional...

Words: 703 - Pages: 3

Free Essay

Computer Science

...Chapter 4: More on Logical, Information, and Text Functions Introduction Logical functions are those that involve Boolean values. The Boolean values are TRUE and FALSE. Some logical functions return a Boolean value as their result, others use the Boolean result of a comparison to choose between alternative calculations. There are six functions listed in the logical group in Excel 2003 – the functions AND, FALSE, IF, NOT, OR, TRUE – and a seventh in Excel 2007 – the function IFERROR. You’ll see the use of most of these in this lab. First, however, it’s worthwhile to become familiar with the logical operators. Logical Operators TRUE and FALSE are common concepts. They are values which pertain to statements. For example, the statement “It is morning.” is either TRUE or FALSE. We recognize that its truth value may change, but at any particular time the statement is either TRUE or FALSE. What may be hidden here is the existence of an implied comparison. To determine the truth value of any statement we compare our understanding of the meaning of the claim with the facts. Strictly speaking the statement “It is morning.” means the time of day is after midnight and before noon. To decide if it’s TRUE we need to know the actual time of day and compare it to our criteria. It’s in these comparisons that we use Logical Operators: |Comparison |Symbol | |less than |< | |less...

Words: 2638 - Pages: 11

Premium Essay

Library and Information Science

...Use of Information Search Techniques and Tools on Web By Prof. A. B. Bhosle* A university, a college or an institution of higher learning is rightly described as community where teachers and scholars are the head, students are the body and the library is it’s heart. If the body is to perform its function properly and efficiently its hearth must be well maintained and strong in its functioning. Thomas Carlyle was not exaggerating when he described a ‘true university as a collection of books’.[1] The library is obviously the source of power of knowledge. In higher education and research, the use of library is a matter of concerns to students, teachers, and researchers. The exponential growth of literature often creates problems for them to access appropriate literature and their use. The problem has, however, considerably been resolved with the help of information and communication technology (ICT). The use of information technology for management and handling of information and data has grown significantly even in many least-developed countries, despite their economic constraints. The use of information technology in libraries has been profoundly affecting all aspects of information acquisition, storage, and transfer. Its magnificent development has dramatically changed the mode of library operations and information services; we have now started to speak of a new type of information source, ‘knowledge base’.[2] Computer-based communications have not only widened...

Words: 2293 - Pages: 10

Free Essay

Dialog Styles

...DIALOG The Dialog service is the world's most comprehensive online information Retrieval service and has been serving users since 1972. With over 600 databases from a broad range of disciplines, Dialog provides international access to information in a broad scope of subject areas. The volume of data available combined with the system's searching capabilities make Dialog the largest and most powerful online service of its type. The Dialog content collection contains hundreds of databases comprised of millions of documents drawn from a multitude of sources. Dialog brings you scientific and technical literature; full-text trade journals, newspapers and newswires; details on millions of chemical substances; information on patents and trademarks issued worldwide; demographic data; and company financial statistics. Accessing Dialog. All Dialog Command Language interfaces are accessible via the Internet using TCP/IP protocols, most commonly using: A Web browser. Internet Explorer 5.X or higher or Netscape Navigator 4.7 or higher are recommended. Internet access is available at the desktop in most businesses and academic institutions. Internet Service Providers (ISP) also provides Internet access for a fee by means of a telephone dial-up connection, DSL broadband cable, or wireless service. In addition to Internet access, you will also need a valid user account for Dialog. Each account is assigned User ID and password that are required in order to log on to the service. Institutions...

Words: 2834 - Pages: 12

Premium Essay

Nothing

..."What is a Boolean Operator?" Alliant Libraries http://library.alliant.edu Boolean Operators are simple words (AND, OR, NOT or AND NOT) used as conjunctions to combine or exclude keywords in a search, resulting in more focused and productive results. This should save time and effort by eliminating inappropriate hits that must be scanned before discarding. Using these operators can greatly reduce or expand the amount of records returned. Boolean operators are useful in saving time by focusing searches for more 'on-target' results that are more appropriate to your needs, eliminating unsuitable or inappropriate. Each search engine or database collection uses Boolean operators in a slightly different way or may require the operator be typed in capitals or have special punctuation. The specific phrasing will be found in either the guide to the specific database found in Research Resources or the search engine's help screens. Proximity Operators (with, near and others) can also help you in searching. See Using Proximity Operators for more details and examples. AND—requires both terms to be in each item returned. If one term is contained in the document and the other is not, the item is not included in the resulting list. (Narrows the search) Example: A search on stock market AND trading includes results contains: stock market trading; trading on the stock market; and trading on the late afternoon stock market OR—either term (or both) will be in the returned...

Words: 461 - Pages: 2

Premium Essay

Final Study

...Guide Boolean Expressions and Relational Operators – Named after English mathematician George Boole. In 1800s Boole invented a system of mathematics in which the abstract concepts of true and false can be used in computations. If-Then statement is formed with a relational operator, which determines whether a specific relationship exists between two values. (>) Greater than operator. (==) Equal to operator. (<) Less than operator. (>=) Greater than or equal to. (<=) Less than or equal to. (!=) Not equal to. The case structure is a multiple alternative decision structure. It allows you to test the value of a variable or an expression and then use that value to determine which statement or set of statements to execute. The testExpression is usually a variable, but in many languages it can also be anything that gives a value (such as a math expression). Short-Circuit Evaluation – In many languages both the AND and OR operators perform short-circuit evaluation. If the expression on the left side of the AND operator is false, the expression on the right side will not be checked. Because the compound expression will be false if only one of the sub-expressions is false, it would waste CPU time to check the remaining expression. So, when the AND operator finds that the expression on its left is false, it short-circuits and does not evaluate the expression on its right. With the OR operator if the expression on the left side of the OR operator is...

Words: 1700 - Pages: 7

Free Essay

Pico

...MEDLINE at http://www.pubmed.gov and conduct a search on your clinical question. Please type your search history in the table below: Search Number | P | I | C | O | T | # of Results | Notes | 1 | Congestive Heart Failure | | | | | 33058 | I typed “congestive heart failure” in the search field and clicked ‘Search’. | 2 | | Home Monitoring | | | | 1077 | I cleared the search field and typed in “home monitoring” and clicked ‘Search’. | 3 | | | | Decreased Readmission | | 11954 | I cleared the search and typed in readmission instead of decreased readmission to widen my search results and clicked ‘Search’. | 4 | #1 | #2 | | #3 | | 40 | I then clicked ‘Advanced Search’ and combined Searches #1, #2, and #3 using the Boolean operator “AND”. I then clicked ‘Search’. | 5 | #1 | #2 | | #3 | 5 years | 22 | I chose to further the search by retrieving only current articles, so I used the same ‘Advanced Search’ from 4 but then clicked on ‘Limits’ and requested only articles from the last 5 years. I then clicked ‘Search’. Although 10-20 articles is preferred I felt 22 returned articles was still close. | | | | | | | | | | | | | | | | | 4. Search: EBSCO/CINAHL Go to the Chamberlain Library at http://www.chamberlain.edu/library and enter EBSCO. Conduct a search on your clinical question. Please type your search history...

Words: 580 - Pages: 3

Free Essay

George Boole Research Paper

...best within the mathematics community for his success in defining logic by using algebra, or Boolean algebra as it is known today. Boole was born on November 2, 1815, in Lincoln, England, known predominantly as an industrial town. Gasser (2006) states “He was the first of four children born to John Boole, a cobbler, and Mart Ann Boole, nee Joyce, a lady’s maid” (p. 377-78). According to Britannica Online (2015), “He was given his first lessons in mathematics by his father, a tradesman, who also taught him to make optical instrument. Aside from his father’s help and a few years at local schools, however, Boole was self-taught in mathematics.” During the timeframe of Boole’s life, there were many political and social events that took place all around the world. Within England, Victoria took the throne in 1837 and would ultimately rule longer than any other British monarch. In 1838, slavery was abolished in the British empire. Additionally, in Ireland in 1845 the great potato famine began that lasted approximately four years killed about a million people, creating a large emigration to England and North America. In North America, in 1846 the Mexican-American War was fought, as well as the Civil War, although Boole died on December 8, 1864, in Ballintemple, Ireland, before the Civil War ended. Boole is most well-known for his discovery of algebra of logic, known today as Boolean algebra. He stated, “Boole was interested in symbolic analysis years before he wrote his Laws...

Words: 813 - Pages: 4

Free Essay

Transfer Time

...such as the binary system, Boolean operations, and the time it takes to transfer data. The average computer user is probably not aware that the actual operations of a computer are done with a binary system. Most of the time a typical computer user has no need to think about this aspect of computers, but every now and then the underlying binary nature will manifest itself. It’s more likely they will encounter a more compact variant of the binary system, called hexadecimal (or “hex” for short). Hex can come up on a Windows error message and the hex addresses may help pinpoint the source of trouble. Hex can also be used by spammers to hide their internet addresses. Another place where hex numbers commonly occur is in hypertext markup language (HTML) code where they are used to designate colors. Boolean Operators are simple words (AND, OR, NOT) used to combine or exclude keywords in a search, resulting in more focused and productive results. Using these operators can greatly reduce or expand the amount of records returned. They are useful in saving time by focusing searches for more ‘on-target’ results that are more appropriate to your needs. The AND operator narrows the search by requiring both terms to be in each item returned. If one term is contained in the document and the other is not, the item is not included in the resulting list. The OR operator broadens the search by making both terms be in the returned document. When using the NOT operator the first term is searched...

Words: 504 - Pages: 3

Premium Essay

Computer

...researching. This course has broaden my knowledge in researching   1) Developing a search strategy showed me how to organize my material and stay on topic. It also introduce me to key concepts which I have been using in my classes when studying and taking notes. Ironically I found using this method at work as well. Recently I found a solution to an ongoing network problem and my manager approached me asking me to fully research the resolution draft an email and send it out to the entire team.By using the search strategy I was able to gather the correct information that was needed to draft the email and send it to my team. 2)The Boolean operator AND OR NOT stuck in my head the most. I learned that this method is the main component to an effective statement and to broaden or narrow your search. When I use to search google without using the Boolean operator I always wondered why the search engine always gave me along list of searchs that didnt really relate to what I was looking up. By using this method I was able to get the exact results that I wanted and as I mention above this method was also used when I did my initial search statement for the email I sent to my colleagues on how to properly resolve the network issue. 3)Lastly the most important component of a research project is to cite the resources appropiately. In this course i was introduce to several styles of citing. There are different citing styles for different  documentation styles. I had to go back and really study...

Words: 337 - Pages: 2

Free Essay

Back Log of Data

...digital logic level output which is dependent on the type of logic gate and the inputs applied to the gate. For the TTL logic family, any gate input that is not connected will be treated as if a logic 1 is present on that input. The number of different possible combinations of inputs is 2n where n is the number of inputs. Therefore, four unique combinations of inputs are possible for a two input gate. A B Q 0 0 1 1 FIGURE 2 0 1 0 1 0 0 0 1 The AND function is similar to the multiplication in mathematics, and provides a logic 1 output only when all the inputs of the gate are at logic 1, and logic 0 output for all other input combinations. Figure 2 contains the logic symbols and truth table for the AND function. The Boolean Equation for a 2 input AND gate, the Boolean Equation is: Q = AB <1> Page 1 ENGI 241 Experiment 5 Basic Logic Gates A B 0 0 1 1 FIGURE 3 Q 1 1 1 0 0 1 0 1 The NAND...

Words: 1423 - Pages: 6

Free Essay

Here It Is

... etc EndIf b. Select Case – Select testExpression Case value_1: statement etc Case value_2: statement etc (And So On) 3. Be able to read a flowchart and determine the output – (Learn how to read a FLOWCHART) 4. Know the relational operators and how to use them: Pg. 119 a. > Greater than (x > y) Is x greater than y? b. < Less than (x < y) Is x less that y? c. >= Greater than or equal to (x >= y) Is x greater than or equal to y? d. <= Less than or equal to ( x <= y) Is x less than or equal to y? e. == Equal to (x == y) Is x equal to y? f. != Not equal to (x != y) Is x not equal to y? 5. Know the different Logic Operators and how to evaluate them: Pg. 147 a. AND – This operator will allow you to connect multiple Boolean expressions. true AND false = false false AND true = false false AND false = false true AND true = true b. OR - This operator will allow you to connect multiple Boolean expressions. true AND false = true false AND true = true false AND false = false true AND true = true c. NOT – This operator reverse the truth of a Boolean expression. NOT true = false NOT false = true 6. Know the different types of loops and...

Words: 1167 - Pages: 5

Premium Essay

Business

...Case study Submission details |Candidate’s Name | |Candidate ID | | |Assessor’s Name | | |Assessment Site | | |Assessment Date/s | |Date | | The Assessment Task is due on the date specified by your assessor. Any variations to this arrangement must be approved in writing by your assessor. Submit this document with any required evidence attached. See specifications below for details. Performance objective The candidate must be able to demonstrate a broad knowledge of research concepts, methods and processes. Assessment description The task is a case study with questions that assesses if the candidate has acquired the underpinning knowledge and skills required to gather, organise, analyse and present research information in the work place. Procedure 1. You have 5 minutes of reading time before you begin the test and 30 minutes to complete the case study questions. 2. You can ask your assessor if you are unsure about any questions. 3. You are to answer all of the questions in the time provided to you by your assessor. ...

Words: 599 - Pages: 3

Free Essay

Asdf

...Computer Science Chapter 1: Introduction to Computer Hardware Different Categories of Computer and Computing Devices Tablets The lightest and most portable Touch interface, good for “light” work Laptops/Notebooks Larger display area; adds CD or DVD as well as physical keyboard They are portable; price for performance is not as good as desktop, choice of hardware is limited Specialized Variant Laptops Ultrabooks Thinner, and lighter than laptops Cost is higher than laptop (all hardware being equal) Netbooks Cheaper more portable laptop that is smaller and has a lower quality display and overall less powerful hardware Much less common than tablets today Desktop Computers Everything is separate (monitor, computer, keyboard, etc); this allows you to mix and match and customize your desktop computer, at the cost of increased complexity (some compatibility issues may arise – not everything works together) and decreased portability. Larger ‘footprint’ (More space is required, but this allows for increase expandability) ------------------------------------------------- Reduced costs/more options (compared to laptops) ------------------------------------------------- The purpose of an operating system is to run the computer. The operating system determines the interface of a computer, its configurability, and its security. In general, due to popularity and tweak-ability, the MS-WINDOWS (PC) OS has more viruses than the MAC OS. In general, the MAC OS...

Words: 3669 - Pages: 15