Back to dashboard home

COMP 3711H: Honors Design and Analysis of Algorithms

CSE ยท School of EngineeringReviews on UST.space
  • 4 credits

Techniques for designing algorithms, proving their correctness, and analyzing their running times. Topics covered include: sorting, selection, heaps, balanced search trees, divide-and-conquer, greedy algorithms, dynamic programming, and graph algorithms. The class will also provide an introduction to advanced techniques such as amortized analysis and the design of randomized and approximation algorithms, as well as providing exposure to more advanced algorithmic solutions to optimization problems, e.g. linear programming and network flow.

Prerequisite
(Grade B+ or above in COMP 2011 / COMP 2012 / COMP 2012H) AND (grade A- or above in COMP 2711 / COMP 2711H / MATH 2343)
Exclusion
COMP 3711

Sign in to see more about COMP 3711H

Unlock more information by signing in with your HKUST account.

Sign in