Analysis techniques, worst-case and average-case analysis, induction, recursion, recurrence relations, and divide-and-conquer design technique. Advanced topics such as Network flows, Advanced Data structures (e.g. Fibonacci heaps, splay trees, dynamic trees), Linear programming, approximation algorithms. Dealing with large data sets, other design techniques such as greedy-method and dynamic-programming, graph algorithms, and text processing algorithms.
- Community Affairs
- Faculty & Staff