Which routine is always correct and sometimes slow?

• A Las Vegas routine
• A Monte Carlo routine
• A deterministic routine with no coins

A random coloring works with positive chance. What follows?

• Every coloring works
• At least one good coloring exists
• No coloring can work

Randomized quicksort averages n log n on any input, with only unlucky coins slowing it.

A Monte Carlo test errs with small chance per run. How do you shrink the error?

• Run it once and trust the speed
• Remove the coins and hope
• Repeat it and combine the runs

What is expected running time counted over?

• The coin flips, on a worst-case input
• The input size, on lucky coins only
• The programmer's patience across edits

Failure chance is bounded below one. What does the bound buy?

• A proof that success sits somewhere
• A faster computer for the search
• A list of every failing case

A manager demands a routine that is both always fast and always right. What do you tell them?

• Coins grant both at once for every problem
• Randomness trades one for the other: fixed speed or certainty must give
• Deterministic code already guarantees both

A team needs a tournament schedule with a rare property. Counting all schedules is hopeless. Which plan fits the method?

• Build one schedule by hand and declare it good
• Draw one at random, bound the failure chance below one, and conclude one exists
• Ask every team to vote on their favorite schedule