Description: This course assumes the knowledge of data-structures. It also assumes the knowledge big-O notation and the concept of time and space complexity of an algorithm. The course also will not introduce divide and conquer, dynamic programming, and greedy paradigms. The course will discuss eff cient algorithms from a large number of domains.
Resources: OpenCourseware from NPTEL (India), Sheridan College, MIT, UC Berkeley, Stanford & many other of the World's finest University's
Professors: Michael Williams