Topics chosen from: Spatial, semi-structured and multi-dimensional data storage and manipulation techniques, non Von-Neumann techniques, advanced and parallel algorithmic techniques, algorithm engineering and problem solving practices; algorithms for matrices and systems of linear equations, approximation algorithms,FFT and convolution and their software and circuit implementations, iteration methods for the solution of operator equations.
COMP4128 Programming Challenges :The focus of the course is the development and implementation of advancedalgorithms. Students will learn to select appropriate algorithms for a given problem,integrate multiple algorithms for solving a complex problem, design new algorithms, and implement them. Algorithms covered include dynamic programming, shortest path, max flow, suffix trees, and combinatorial algorithms. They will also learn skills required for programming contests, which include evaluation of problem difficulty, solving problems in teams, and work under time pressure.
COMP4129 Programming Challenges B :-This course builds on the activities from COMP4128 with the development andimplementation of more advanced algorithms, such as maximum matching, A*, geometric algorithms, iterative deepening and advanced dynamic programming.They will also practice the skills required for programming contests — evaluation of problems, team work and time management.
Let’s block ads! (Why?)