Apr 20, 2024  
University Undergraduate Catalog 2017-2018 
    
University Undergraduate Catalog 2017-2018 [ARCHIVED CATALOG]

COMP 3810 - Design and Analysis of Algorithms (3)


Prerequisites: C or better in COMP 2810 . A course in which students learn to use general asymptotic notations; solve recurrences; and design, analyze and, where applicable, prove correctness of optimality of algorithms using divide-and-conquer, greedy, and dynamic programming techniques. Analysis and proof of correctness of graph algorithms and issues from computational complexity will be included.


Click here for the Spring 2022 Class Schedule