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 DocumentThis 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 DocumentThis 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 DocumentThis 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 DocumentThis 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 DocumentThis 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: CS70: Satish Rao: Lecture 15. Outline. 1. Counting. 2. Enumerate 3. Tree 4. Rules of Counting 5. Sample with/without replacement where order does/doesn’t matter. Probability is soon..but first let’s count. Count? How many outcomes possible for k coin tosses? How many poker hands? How many handshakes for n people? How many diagonals in a convex polygon? How many 10 digit numbers? How many 10 digit numbers without repetition? Enumerate 000 Enumerate 000 – 1 (helan) 001 Enumerate 000 – 1 (helan) 001 – 2 (halvan) 010 Enumerate 000 – 1 (helan) 001 – 2 (halvan) 010 – 3 (tersen) 011 Enumerate 000 – 1 (helan) 001 – 2 (halvan) 010 – 3 (tersen) 011 – 4 100 Enumerate 000 – 1 (helan) 001 – 2 (halvan) 010 – 3 (tersen) 011 – 4 100 – 5 101 Enumerate 000 – 1 (helan) 001 – 2 (halvan) 010 – 3 (tersen) 011 – 4 100 – 5 101 – 6 110 Enumerate 000 – 1 (helan) 001 – 2 (halvan) 010 – 3 (tersen) 011 – 4 100 – 5 101 – 6 110 – 7 111 Enumerate 000 – 1 (helan) 001 – 2 (halvan) 010 – 3 (tersen) 011 – 4 100 – 5 101 – 6 110 – 7 111 – 8 Using a tree.. 000 001 1 010 011 1 1 100 101 1 110 111 1 1 1 Using a tree.. 000 001 1 010 011 1 1 100 101 1 110 111 1 1 1 Using a tree.. 000 001 1 010 011 1 1 100 101 1 110 111 1 1 1 Using a tree.. 000 001 1 010 011 1 1 100 101 1 110 111 1 1 1 Using a tree.. 000 001 1 010 011 1 1 100 101 1 110 111 1 1 1 8 leaves which is 2 × 2 × 2 . First Rule of Counting: Product Rule Objects made by choosing from n 1 , then n 2 , ... , then n k the number of objects is n 1 × n 2 ···× n k . · · · · · · · · · · · · First Rule of Counting: Product Rule Objects made by choosing from n 1 , then n 2 , ... , then n k the number of objects is n 1 × n 2 ···× n k . n 1 · · · · · · · · · · · · First Rule of Counting: Product Rule Objects made by choosing from n 1 , then n 2 , ... , then n k the number of objects is n 1 × n 2 ···× n k . n 1 × n 2 · · · · · · · · · · · · First Rule of Counting: Product Rule Objects made by choosing from n 1 , then n 2 , ... , then n k the number of objects is n 1 × n 2 ···× n k . n 1 × n 2 × n 3 · · · · · · · · · · · · First Rule of Counting: Product Rule Objects made by choosing from n 1 , then n 2 , ... , then n k the number of objects is n 1 × n 2 ···× n k . n 1 × n 2 × n 3 · · · · · · · · · · · · In picture, 2 × 2 × 3 = 12! First Rule of Counting: Product Rule Objects made by choosing from n 1 , then n 2 , ... , then n k the number of objects is n 1 × n 2 ···× n k . n 1 × n 2 × n 3 · · · · · · · · · · · · In picture, 2 × 2 × 3 = 12! Remember the first rule.....
View
Full
Document
This note was uploaded on 02/29/2012 for the course COMPSCI 70 taught by Professor Rau during the Fall '11 term at Berkeley.
 Fall '11
 Rau

Click to edit the document details