CSE 101 Math 188 - Design and Analysis of Algorithms

Description: Introduction to the design and analysis of efficient algorithms. Basic techiques for analyzing the time requirements of algorithms. Algorithms for sorting, searching, and pattern matching, algorithms for graphs and networks, NP - complete problems.
Text Book: The algorithm Design Manual by Steven S. Skiena
Instructor: Professor Fan Chung Graham

CONTENTS:
Part one : TECHNIQUES
Part two : DATA STRUCTURES AND SORTING
Part three : BREAKING PROBLEMS DOWN
Part four : GRAPH ALGORITHMS
Part five : Combinatorial Search Heuristic Methods
Part six : Interactable Problems and Approximations