Jun 21, 2024  
2009 Summer Sessions Bulletin 
    
2009 Summer Sessions Bulletin [ARCHIVED BULLETIN]

Add to Personal Catalog (opens a new window)

CSC 204 - Algorithm Design and Analysis


Review of algorithm basics (Big-Oh, Big-Theta and Big-Omega notation), algorithms for searching, sorting (Mergesort, Quicksort, Heap Sort), median order statistic, hashing, priority queues, red-black trees, AVL trees, dynamic programming, amortized analysis, graph algorithms for shortest path problems, minimum spanning tree, min-cut and max-flow problems and NP completeness. 

Prerequisites & Notes
Course open to graduate students in computer science, others need permission from computer science graduate director. (Formerly Algorithms I: Sorting and Searching.)

Semester Hours: 3

Summer 2009 Offering:
SSII
70677: Distance Learning, Kamberova
Course meets 7/13-8/28.





Add to Personal Catalog (opens a new window)