Welcome

Motivation for the Course: Ever since computer scientists learned to write algorithms, the notion about making an algorithm efficient has been an important one. It was soon identified that finding a way is not enough -- an inefficient way is not useful! Since then, a lot of effort has been invested to derive efficient algorithms.

The importance of efficiency of an algorithm cannot be overstated in today's world. Unlike in the sixties, today computers have made inroads into every way of our life. And, buttressed with the ever-increasing computing power, today's computers deal with millions of records. Along with the power, comes higher expectations. Unlike yesteryears, we expect the result to be handed over in real-time. If Google took 10 minutes to answer search results on gator football, there would not be too many (happy) users!

This course is structured towards exposing the students to different methods of approaching a solution and analyzing the efficiency. You will learn the different generic classes of algorithms (like divide-and-conquer, greedy approach, dynamic programming etc.) At the end of the course, you will get acquainted with tough problems that may or may not be possible to solve efficiently!

Keeping in mind that this is a graduate-level core course, the students are expected to know undergraduate data structures & algorithms, where the students are introduced to different data structures (queues, heaps, trees, lists etc.) and graph theory.

The actual purpose of this course is much more than just knowing the syllabus. It is to make you think and think differently. You are encouraged to open your mind and start thinking about solving problems in a completely different manner.

Enrolled Students: It is your responsibility to check announcements at least once every day. This is going to be your sole point of information gathering - you will not be sent any individual email.

Your web browser needs to support HTML4.01, CSS2 and JavaScript to correctly view these webpages.