CSCI 305 - Analysis of Algorithms and Data Structures I

Introduction to the analysis of algorithms and data structures in a mathematically rigorous fashion. Mathematical fundamentals, counting, discrete probability, asymptotic notation, recurrences, loop invariants. Worst-case, probabilistic and amortized analysis techniques applied to sorting algorithms and classic data structures such as heaps, trees and hash tables. Design techniques such as branch and bound, divide and conquer, will be introduced as will correctness proofs for algorithms.

Prerequisites & Notes: CSCI 241; CSCI 301.
Credits: 4
Grade Mode: Letter