Algorithms (ArsDigita University). Taught by Shai Simonson, this course discusses the design and analysis of algorithms. The design of algorithms is studied, according to methodology and application. Methodologies include: divide and conquer, dynamic programming, and greedy strategies. Applications involve: sorting, ordering and searching, graph algorithms, geometric algorithms, mathematical (number theory, algebra and linear algebra) algorithms, and string matching algorithms. Analysis of algorithms is studied - worst case, average case, and amortized - with an emphasis on the close connection between the time complexity of an algorithm and the underlying data structures. NP-Completeness theory is examined along with methods of coping with intractability, such as approximation and probabilistic algorithms. (from ADUni.org)
Instructor: Shai Simonson. Course Description. Lecture and Courseware. Student Evaluations. The design of algorithms is studied, according to methodology and application.