Description

This course covers major algorithm design techniques; theoretical analysis of nonrecursive and recursive algorithms; applications to sorting, searching, string matching, graphs; P and NP complexity classes; and approximation algorithms.

Specific Outcomes

Prerequisites