Search Results

This course is an introduction to advanced data structures and algorithm analysis techniques. Topics to be covered include asymptotic notation, empirical and theoretical analysis techniques, complexity classes, algorithmic approaches (divide and conquer, greedy), and advanced tree structures. Three hours lecture. Prerequisites: MA 162, CS 106.