COSI 29a Chapter Notes - Chapter 1.2: Bitwise Operation

• School: Brandeis University
• Department: Computer Science
• Course: COSI 29a
• Professor: Cherniack Mitch

Document Summary

A 1 bit represents true and a 0 bit represents false. Often, programs represent (cid:1513) as or, (cid:1512) as. A bit string is a sequence of bits, and the length of the string is the number of bits in the string. The bitwise operations are the bit operations of bit strings. Ex: the bitwise operations of two strings are shown: A compound proposition that is always true is called a tautology. A compound proposition that is always false is called a contradiction. A proposition that is neither is a contingency. Ex: p p is a tautology. p (cid:1512) p is a contradiction. Propositions p and q are logically equivalent if p q is a tautology. Logically equivalent propositions are denoted as p q. Also, it can be denoted as p q. Ex: p q and p (cid:1513) q are logically equivalent.