BOSTON_UNIVERSITY · CAS CS · COURSE SHEET
CAS CS 537See offeringsHas prerequisites
Randomness in Computing
CT Score
1500
#0 of 0 in CAS CS
Difficulty
—/10
Workload
—h/wk
Median grade
—
from grade distribution
Would take again
—
n = 0 verified
Grade distribution
No distribution published for this course.
By professor: same course, different game
PROFESSORSCOREGRADEHRS/WKTERMS
Professor ratings →Sections
No section data for this term yet.
In the tree
(CASCS 330 OR CASCS 530). CASCS 535 is recommended or consent of instructor. - Graduate Prerequisites: CASCS 330 or CASCS 530 is recommended. - Survey of probabilistic ideas of the theory of computation. Topics may include Monte Carlo and Las Vegas probabilistic computations; average case complexity and analysis; random and pseudorandom strings; games and cryptographic protocol; information; inductive inference; reliability; others. (Offered alternate years.)→CAS CS 537→unlocks 0 courses
No mapped courses require this one yet. See on the map →
Study groups
0 active🔒 Verified-only writes. You post as “sophomore, lecture section”: real enough to trust, anonymous enough to be honest.