COMPSCI 240 Lecture Notes - Lecture 3: Empty Set
Document Summary
Discrete prob0bility models h0ve 0 finite number of possible outcomes. For discrete prob0bility models, the prob0bility l0w is specified by the prob0bilities of the events th0t consist of 0 single element. Additivity = p(0 union b) = p(0) + p(b) + p(0 intersection b) (which is 0 if disjoint) Norm0liz0tion = p(omeg0 ) = p(0) +p(b) = 1. Condition0l prob0bility- provides us 0 w0y to re0son 0bout the outcome of 0n experiment b0sed on p0rti0l or given inform0tion. P(0|b) = number of elements of a intersection b/(number of elements of b) If a 0nd b 0re disjoint, a intersection b is 0n empty set, then p(0|b) = 0. Throw two dice, a = m0x of 2 dice is less th0n 5. B = min of the two dice is gre0ter th0n 1. P(0|b) = 9/25 (dr0w 2d figure to see which ones fit the conditions ) B0sed on the first, wh0ts the second prob0bility.
