The module will cover basic concepts in the design and analysis of randomized algorithms. It will cover both basic techniques, such as Chernoff bounds, random walks, and the probabilistic method, and a variety of practical algorithmic applications, such as load balancing, hash functions, and graph/network algorithms. The focus will be on utilizing randomization to develop algorithms that are more efficient and/or simpler than their deterministic counterparts.

Module Examinable :

-

Exam Date :

No Exam Date.

Modular Credits :

4

Pre-requisite :

CS3230

Preclusion :

Nil

Module Workload (A-B-C-D-E)* :

2-1-0-4-3

Remarks :

Nil

*

A: no. of lecture hours per week
B: no. of tutorial hours per week
C: no. of laboratory hours per week
D: no. of hours for projects, assignments, fieldwork etc per week
E: no. of hours for preparatory work by a student per week