Analysis of Algorithms
Units: 1.5, Hours: 3-0
General techniques for designing and analyzing algorithms; an in-depth examination of several problems and algorithms with respect to their time and space requirements; advanced data structures; sorting and searching; graph algorithms; backtracking; NP-complete problems; approximation algorithms.
Note: Credit will be granted for only one of 425, 420.
Prerequisites: 320, 326.
Undergraduate course in Computer Science offered by the Department of Computer Science in the Faculty of Engineering.