The following is simply a conveniently formatted list of learning goals. More likely than not, some might be hard to assess through a quiz or exam. Students should prioritize their studying based on:
- how much time in lecture was spent discussing or understanding the topic,
- how much the topic was stressed in learning group assignments
- and the student's comfort level with the topic
Assessable Learning Goals covered for Quiz 3
Recall casino thieves, be able to write an algorithm that deals deterministic n-player 5-card draw poker hands
Know how to write Monte Carlo simulations for estimating a discrete data histogram of many events.
What (arithmetic) pRNG properties did the thieves take advantage of in electronic poker games?
What is a full period multiplier and why is it important to Lehmer pRNGs?
Explain what "random numbers fall mainly in the planes" means.
What is the geometric interpretation of multiple Lehmer pRNG streams?
What is a distribution's idf()?
Know what constitutes a histogram and how it is connected to CDFs.
Know how to maniuplate and derive CDFs and PDFs of variables that are functions of a Uniform(a,b) input.
Know the F(x) inversion technique for constructing random variates. What is the requirement on F(x)?
Know three techniques for truncating pre-existing random variates.