COMPX301

This course is for students interested in the art and science of computer programming. It is concerned with advanced data structures and their algorithms.

It involves a study of classical and recently discovered methods for solving a diverse range of computational problems. Analysis of important performance characteristics (such as efficiency, scalability, applicability, adaptability, and design) will also be addressed.

A survey of problem spaces and techniques for addressing specific examples using useful/interesting algorithms and data structures is offered. Examples typically include: string algorithms, data compression, pattern searching, external methods, dynamic programming, geometric algorithms, heuristic methods, and so forth.

The aim is to equip students to address future novel problems, and prepare them for industry and/or research careers. A key objective is to give students a deeper understanding of the connection between computing theory and practice. This course should be considered essential for computer scientists and software engineers.