25 verified PDFs
Design and analysis of data structures and algorithms. Divide-and-conquer, greedy, and dynamic programming algorithm design techniques. Prerequisite(s): MATH 30 ...
Basic Tools and Techniques: order notation, induction, recurrence relations, summing sequences, lower bound for comparison-based sorting algorithms.
The syllabus below describes a recent offering of the course, but it may not be completely up to date. For current details about this course, please contact ...
Topics to be Covered: algorithm analysis techniques including asymptotic notation, solving recurrences, amortized analysis; algorithm design techniques ...
Analysis of algorithms including time complexity and Big-O notation. Analysis of stacks, queues, and trees, including B-trees. Heaps, hashing, and advanced ...
