Description
This course introduces the fundamentals of algorithm function and design for sorting and order statistics and advanced design and analysis techniques. Data structure discussion will include elementary structures, hash tables, binary search and red-black trees, Fibonacci Heaps, and disjoint sets. Selected topics will include multithreaded algorithms, matrix operations, linear programming, string matching, computational geometry, NP-completeness, and approximation. Prerequisite: IT-105. Offered: Fall.