COMP 690 — Probabilistic Analysis of Algorithms

Name: COMP 690 — Probabilistic Analysis of Algorithms
Rating: 4.6 (95 reviews)

Probabilistic analysis of algorithms and data structures under random input. Expected behaviour of search trees, tries, heaps, bucket structures and multidimensional data structures. Random sampling, divide-and-conquer, grid methods. Applications in computational geometry and in game tree searching. Combinatorial search problems. Algorithms on random graphs.

Rating: 4.60 out of 5 from 95 student reviews
Difficulty: 3.80 out of 5
Credits: 4
Faculty: Graduate Studies
Department: Computer Science