In this course you will learn several fundamental principles of algorithm design. You'll learn the divide-and-conquer design paradigm, with applications to fast sorting, searching, and multiplication.
 
This is a course on programming, data structures and algorithms. The learner is assumed to have  prior experience of C programming. The course will run over four weeks with about 2-3 hours  of lectures three days per week.

At the end of each week, the learner is expected to write some programs and submit them for grading. These programming problems are classified as easy, moderate or difficult. The easy problems, typically, are repeats from the lecture. The moderate and difficult ones will require increasing levels of initiative from the learner.