This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: illustrates, on our example, what each of those formulas means. X s ∈ S X ( s ) P ( s ) = X ( HHH ) P ( HHH )  {z } + X ( HHT ) P ( HHT ) + X ( HTH ) P ( HTH ) + X ( THH ) P ( THH )  {z } + X ( HTT ) P ( HTT ) + X ( TTH ) P ( TTH ) + X ( THT ) P ( THT )  {z } + X ( TTT ) P ( TTT )  {z } F 1 F 2 F 3 F 4 = · P ( HHH )  {z } + 1 ` P ( HHT ) + P ( HTH ) + P ( THH ) ´  {z } + 2 · ` P ( HTT ) + P ( TTH ) + P ( THT ) ´  {z } + 3 · P ( TTT )  {z } F 1 F 2 F 3 F 4 = x 1 P ( F 1 ) + x 2 P ( F 2 ) + x 3 P ( F 3 ) + x 4 P ( F 4 ) = k X i =1 X s : s ∈ F i X ( s ) P ( s ) = k X i =1 x i X s : s ∈ F i P ( s ) = k X i =1 x i P ( F i ) = E ( X )...
View
Full
Document
 Spring '10
 M.J.Golin
 Computer Science

Click to edit the document details