AU: 3.0
Programme: CSC(CE)

Introduction to algorithms, basics for analysis of algorithms, sorting, searching, graphs, basic computability and complexity theory


This is an important module for foundational computer science students. The lecture slides are generally okay, except in some cases (like heapsort) codes or pseudocodes are a bit confusing, in which case wikipedia or mathworld tends to explain better. Quite a lot of proofing to learn, especially the last part graph theory is not easy if one really wants to absorb the knowledge.