It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) . We will ...

Introduction to theory of algorithms guided by basic Python programming. Algorithmic thinking ... For assessment, this may involve changes to mode of delivery and/or the format or weighting of ...

Advanced study in models of computation, programming languages and algorithms with a specific focus on concurrent ... The exam could be online, oral, field, practical skills, written exams or another ...