
CSE Home  About Us  Search  Contact Info 
Schedule details will evolve as we go; check back periodically to see the latest updates.
Due  Lecture Topic  Reading  

Week 1 1/31/7 
M  Introduction  Unless otherwise noted, all section of Ross marked "*" or "optional" may be omitted.  
W  Counting: combinations, permutations, etc.  Ross, Ch 1 (exclude 1.6)  
F  Axioms of Probability  Ross, Ch 2 (exclude 2.6)  
Week 2 1/101/14 
M  
W  Conditional Probability & Independence  Ross, Ch 3; (exclude the "stared" portion of 3.4 starting at the bottom of p86, except for "Gambler's Ruin," example 4l)  
F  
Week 3 1/171/21 
M  Holiday  
W  Conditional Probability & Independence  
F  Random Variables  Ross, Ch 4; exclude 4.7 example 7d and all of 4.8 except 4.8.1 and 4.8.3  
Week 4 1/241/28 
M  
W  
F  Ross, Ch 5; exclude 5.5.1 and 5.6  
Week 5 1/312/4 
M  
W  Random Variables/Midterm Review  
F  Midterm  
Week 6 2/72/11 
M  Analysis of Algorithms; Tails and Limit Theorems  Ross, Ch 6:
pp 250251 (two "Remarks" & Ex 2j);
pp 256258 (Prop 3.2 & Ex 3c; omit proof of prop);
Ross, Ch 7: pp 300301 (Ex 2c, 2e); pp 306308 (Ex 2m, a different analysis than in lecture); pp 354355 (omit Ex 7a, 7b). (FYI, pp 358359 tables are useful summaries; omit the MGFs, the neg.bin. & gamma distributions. See also here.) Ross, Ch 8. Omit: proofs of Central Limit Theorem, Strong Law of Large Numbers, 8.5, 8.6. 

W  
F  
Week 7 2/142/18 
M  Max Likelihood Estimators, EM, Hypothesis Testing  Weisstein, E.W. "Maximum Likelihood." From MathWorldA Wolfram Web Resource, Wikipedia Likelihoodratio test ("Background" and "Simpleversussimple hypotheses"), Wikipedia Likelihood Function (through 2.1).  
W  
F  
Week 8 2/212/25 
M  Holiday  
W  Polynomial Time and NPCompleteness  DPV: Preface, Chapter 0, 1.1, 2.1, (optional: 2.2), 2.32.5, 6.16.4, 6.6, Chapter 8.  
F  
Week 9 2/283/4 
M  
W  
F  
Week 10 3/73/11 
M  
W  
F  Wrap up & Review  
Week 11 3/143/18 
M  Final Exam 
Textbooks:
Required:
A First Course in Probability (8th edition), Sheldon M. Ross, Prentice Hall, 2009. (Available from U Book Store, Amazon, etc.)
Online. The last few weeks of the quarter will use the following, available free online:
Algorithms, by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani
Reference. (No direct use of this, but if you already own a copy, keep it for reference. Some students have said they like its coverage of counting (Chapter 5 and 7.5, 7.6) and discrete probability (Chapter 6)):
Discrete Mathematics and Its Applications, (sixth edition) by Kenneth Rosen, McGrawHill, 2006. Errata. (Available from U Book Store, Amazon, etc.)
Supplementary Reading:
In addition to the assigned text, there are many supplementary resources available on the web and elsewhere that may be helpful. Here are a few. I welcome hearing about others that you discover.
The open access textbook for the Chance project. Roughly comparable in coverage to Ross, but with a different slant, of course.
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 981952350 (206) 5431695 voice, (206) 5432969 FAX 