Jun 25, 2021  
2010-2011 Catalog 
2010-2011 Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

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, 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, dynamic programming and greedy algorithms will be introduced as will correctness proofs for algorithms.

Prerequisites & Notes:
CSCI 211, CSCI 241

Credits: 3
Grade Mode: L

Sciences and Technology
Computer Science

Add to Portfolio (opens a new window)