Algorithms And Complexity.

Catalog description

Recommended for students pursuing a graduate degree in Computer Science, definitions of algorithm and its complexity, proof of correctness of an algorithm, notion of time and space complexity, the complexity hierarchy, average and worst case complexity, complexity of search and sorting algorithms, recurrence relations arising from basic algorithms, linear and non-linear recurrences, divide-and-conquer algorithms, dynamic programming. Prerequisite: CSCI 287 Data Structures.