CSCD 423. RANDOMIZED ALGORITHMS AND PROBABILISTIC ANALYSIS. 4 Credits.
Notes: may be stacked with CSCD 523.
Pre-requisites: CSCD 320 with a grade ≥2.5.
This course introduces the use of probability in computer science algorithm design and analysis. The course covers two subfields. One is the design of randomized algorithms, where decisions at some steps are determined by coin tossing. The other is the probabilistic analysis of (randomized or deterministic) algorithms. The goal is to measure the expected performance of an algorithm. Basic knowledge and techniques developed from the probability theory will be introduced. Workload include problem solving homeworks and programming assignments.