Classwork:
1. At classroomSalon.com:
Video 11.1 has questions.
Please type “done” in edmodo.com when you are finished.

2. At edmodo.com:
Uniform hashing assumptions:
From Video 11.1:

Coupon collector. Suppose that you have a shuffled deck of cards and you turn them face up, one by one. How many cards do you need to turn up before you have seen one of each suit? This is an example of the famous coupon collector problem. In general, suppose that a trading card company issues trading cards with N different possible cards: how many do you have to collect before you have all N possibilities, assuming that each possibility is equally likely for each card that you collect?

Illustrate the assumption made in the video either mathematically or with program YI_CouponCollector.
NOTE: Be clear and concise

Homework:
At classroomSalon.com:
Video 11.2 has questions.
Please type “done” in edmodo.com when you are finished.

NOTE: Classroomsalom.com has gone mobil now!!!!