You are here

Power of Randomness in Computation

Author: 
Zuckerman, David
Issue Date: 
Monday, September 8, 2008
Description: 
The presenter talks about the usefulness of randomness in CS noting algorithms, Monte Carlo simulations, cryptography. He explores the generation of pseudo-random numbers and the quality of random numbers generated including the minimal randomness requirement.
Keywords: 
randomness, use of randomness, simulation, random sampling
Other Disciplines: 
Monte Carlo simulations, cryptography, random number generator
Education Levels: 
Middle School
High School
Intended Audience: 
Educator
Type: 
Instructional Material : Lecture/Presentation
Publisher: 
U Texas-Austin
URL: 
http://www.cs.utexas.edu/~firstbytes/teachers/index.html
CSTA Classification: 

CPP.L3A-12

Describe how mathematical and statistical functions, sets, and logic are used in computation.

CT.L3B-01

Classify problems as tractable, intractable, or computationally unsolvable.

CPP.L3B-06

Anticipate future careers and the technologies that will exist.

CI.L3B-02

Analyze the beneficial and harmful effects of computing innovations.

CT.L3B-06

Compare and contrast simple data structures and their uses (e.g., arrays and lists).

CC.L3C-01e

Standard Algorithms (AP Comp Sci A Topic V)

CC.L3C-12

Other Project-Based Courses

Download this resource: