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) .

View on Coursera Course Decription This course introduces number-theory based cryptography, basics of quantum algorithms and advanced data-structures. Learning Outcomes Understand how basic ...

Goal programming is a very powerful technique for solving multiple objective optimisation problems. It has been successfully applied to numerous diverse real life problems. In this paper a Taboo ...