Ayúdanos a dar forma a GoConqr. ¿Qué deberíamos añadir?

Diapositivas

EXAM 1

Anton Nguyen Discrete Math Inglés 15 diapositivas

Diapositivas del conjunto (15)

  1. CH1: SPEAKING MATHEMATICALLY

    • Universal statement: "for all"
    • Conditional statement: "if-then"
    • Existential statement: "there is"
    • x ∈ s = x is an element of s
    • x ⊄ s = x is not an element of s
    • {x ∈ s | P(x)} =
    • the set of all elements x in s such that P(x) is true
  2. MORE SYMBOLS

    • Real numbers: can be positive or negative, whole numbers or decimal numbers. called "real numbers" because they're not imaginary.
    • R = all real numbers (or Relation)
    • Integer: a positive or negative number with no fractional part
    • Z = all integers
    • Rational numbers: a number that can be made by dividing two integers (forming a fraction)
    • Q = all rational numbers
    • ∃ = there exists
    • ∀ = for every; for any; for all
    • iff. = if and only if
    • ⟺ = if and only if
    • + / - / nonneg = this superscript indicates that only the positive or negative or nonnegative elements of the set are to be included
  3. EXAMPLES

    • 1) Is {0} = 0?
    • No. {0} is a set with 0, where 0 is simply a number.
    • 2) How many elements are in the set {1, {1}}?
    • Two. 1, and the set whose only element is 1.
  4. SETS

    • A ⊆ B = A has some or all elements of B. A is a subset of B.
    • A ⊂ B = A has some elements of B. A is a proper subset of B.
    • Cartesian Product: A x B = {(a,b) | a ∈ A and b ∈ B}
    • A function (x R y means that (x,y) ∈ R) from a set A to a set B satisfies the following properties:
    • 1) EVERY element of A is the first element of an ordered pair of F
    • 2) No 2 distinct ordered pairs have the same 1st element
    • EXAMPLE
    • A = Z+ // B = {n ∈ Z | 0 ≤ n ≤ 100} // C = {100,200,300,400,500}
    • Is B ⊆ A?
    • 1) False. O is not a positive integer.
  5. CH2: LOGICAL FORM AND EQUIVALENCE

    • Statement / proposition: a sentence that is true or false but not both
    • x + y > 0 = not a statement
    • 1 + 2 > 0 = is a statement
    • He is smart = not a math statement
    • LOGIC SYMBOLS
    • ∧ = and
    • ∨ = or
    • ~ = negation / not
    • OPERATIONS RULES
    • Anything in parentheses has priority. ~ is performed first. ∧ and ∨ are coequal. [-> and <-> have low priority.]
  6. TRUTH TABLES

    • NOT [A VARIABLE]: List the true and false values, then reverse them for the not column
    • CONJUNCTION (AND): all values must be true for it to be true
    • INCLUSIVE OR: if one or more values are true, this is true
    • EXCLUSIVE OR: if only one value is true, this is true
    • GOLDEN RULE: start a table by considering the possible combos of truth values for the basic variables (p,q,r,etc)
    • TAUTOLOGY (t): a statement that is true for all replacements of the variables
    • p ∨ ~p is a tautology, because the results are both true
    • CONTRADICTION (c): a statement that is false for all replacements of the variables
    • p ∧ ~p is a contradiction, because the results are both false
  7. EXAMPLES

    • 1) Negate this inequality.
    • 1 > x ≥ -3
    • -3 ≤ x < -1
    • Divide into two statements, p and q.
    • (x ≥ -3) and (x > 1)
    • Negate it. Turn the sign the other way, and add a line if there was none before or take away the sign if it's already there.
    • (x < -3) or (x ≥ 1)
    • Switching the 'and' to 'or' is important!!
    • 2) Use DeMorgan's Law to write the negation of p ∧ q.
    • p ∧ q becomes ~(p ∧ q), according to DeMorgan's Law.
    • ~(p ∧ q) = ~p ∨ ~q
    • The variables are negated and the sign switches.
  8. IF-THEN

    • p -> q = if p then q / p implies q
    • The negation of "if p then q" is "p and not q".
    • p -> q = (p ∧ ~q), p -> q = ~(p ∧ ~q)
    • Think "If it is raining (p), then it is cloudy (q)." If q and p are true, then true. If p is true and q is false, then false. If p is false and q is true, then true. If p is false and q is false, then false.
    • p <-> q = (p -> q) ∧ (q -> p)
    • A biconditional is true when both have the same truth values.
    • p -> q = original
    • ~p -> ~q = inverse of original
    • q -> p = converse of original
    • ~q -> ~p = contrapositive of original
    • An original statement is equivalent to its contrapositive.
    • An inverse statement is equivalent to the converse.
  9. NUMBER SYSTEMS AND CIRCUITS

    • BASE 10
    • ..., 10^4, 10^3, 10^2, 10^1, 10^0
    • [..., 10000, 1000, 100, 10, 1]
    • 347 = 3 * (10^2) + 4 * (10^1) + 7 * (10^0)
    • = 300 + 40 + 7
    • = 347
    • BASE 10 SYMBOLS: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9
    • BASE 2
    • ..., 2^3, 2^2, 2^1, 2^0
    • [128, 64, 32, 16, 8, 4, ...]
    • 1110 = 1 * (2^3) + 1 * (2^2) + 1 * (2^1)
    • = 8 + 4 + 2
    • = 14 (base10)
    • BASE 2 SYMBOLS: 0, 1
  10. EXAMPLES

    • 1) Convert from decimal to base 2.
    • 27 = 1 [16] | 1 [8] | 0 [4] | 1 [2] | 1 [1]
    • 27 (base10) = 11011 (base2)
    • alt: DIVISION METHOD
    • Divide 2 into the decimal number. Whatever number you get, continue dividing by two until you get to zero.
    • The remainders you collect is the answer (from bottom to top).
    • 2)
  11. ADDING AND SUBTRACTING BINARY

    • ADDING IN BINARY:
    • 1 + 1 = 10
    • 1 + 1 + 1 = 11
    • Remember those rules when carrying over.
    • SUBTRACTING IN BINARY:
    • 10 - 1 = 1
    • BORROWING:
    • When there's a row of zeros, you must borrow from the first 1 to the left and transfer value to all the zeroes.
    • When you borrow from 1, cross it out and write '0'. Then the zero to the right should be crossed out and have '10' (which is essentially two 1's). If another zero needs a value, cross out that '10', change it to '1', and give the zero to the right the '10'. Continue this until all zeros have value to subtract from.
  12. BASE 16

    • HEXADECIMAL
    • 0
    • 1
    • 2
    • 3
    • 4
    • 5
    • 6
    • 7
    • 8
    • 9
    • A
    • B
    • C
    • D
    • E
    • F
    • BINARY
    • 0000
    • 0001
    • 0010
    • 0011
    • 0100
    • 0101
    • 0110
    • 0111
    • 1000
    • 1001
    • 1010
    • 1011
    • 1100
    • 1101
    • 1110
    • 1111
  13. EXAMPLES

    • 1) Convert from hex to base 10.
    • **Remember: 16^4, 16^3, 16^2, 16^1, 16^0, etc
    • B2 = 11 * (16^1) + 2 * (16^0)
    • = 176 + 2
    • = 178 (base10)
    • 2) Convert B2 to base 2.
    • B2 = 1011 [8 4 2 1] | 0010 [8 4 2 1]
    • = 10110010 (base2)
    • 3) Convert from decimal to hex.
    • **The division method could also be used here.
    • 229 = 1 [128] | 1 [64] | 1 [32] | 0 [16] | 0 [8] | 1 [4] | 0 [2] | 1 [1]
    • = 11100101
    • = (going right to left) 1110 is E and 0101 is 5
    • = E5 (hex)
  14. TWO'S COMPLEMENTS

    • 2^a - n, where a is the bit number and n is the integer
    • Common bit lengths: 4, 8, 16, 32, 64
    • 8BIT REPRESENTATION TO COMPUTE TERMS:
    • Make sure to change every decimal into binary first, using the "128-64-32-so forth" system. If a value is negative, do the normal value first and then flip the bits, going right to left. Copy the sequence until you see the first 1. Write down that 1, and then start flipping the bits.
    • If 1 is the very first number, write the 1 and then immediately start flipping to the left.
    • Once you have the binary numbers, put them into an appropriate addition or subtraction setting. Then complete the math according to binary addition/subtraction rules.
  15. FIND THE 2'S COMP. OF 27 IN 8BIT

    • 1) USING THE DEFINITION
    • 2^8 - 27 = 256 - 27
    • = 229
    • = 11100101
    • 2) 1 THEN INVERT
    • 27 = 00011011
    • -27 = 11100101

Información

Descripción
Discrete Math Diapositivas sobre EXAM 1, creado por Anton Nguyen el 12/09/2017.
Creado por
Anton Nguyen
Visitas
19
Valoración

Escríbenos

¿Sobre qué es tu mensaje?

¿Qué deberíamos añadir?