|Instructor:||Andrew L. Mackey|
|Meeting Times:||Tuesdays/Thursdays at 12:30 - 1:45 pm|
|Lab Assistant:||Kyle Kelly|
|Lab Times:||Fridays at 2:00 pm - 4:00 pm|
Theoretical foundations and practical applications of algorithm analysis and design. Builds upon the data abstractions introduced in CS 2003 - Data Structures, while introducing various algorithm strategies and techniques.
Students are required to have a prior background in data structures (e.g. arrays, linked lists, stacks, queues, binary trees, graphs, etc.), calculus, and discrete mathematics.
The follow list contains courses that I have taught within the past few years.
|3||Heaps, Priority Queues, and Heapsort|
|6||Linear Time Sorts|
|7||Height-balanced Binary Search Trees|
|8||Advanced Data Structures|
|10||Dynamic Programming (cont.)|
|13||Minimum Spanning Trees|
|14||Single-Source Shortest Path Algorithms|
|15||All-Pairs Shortest Path Algorithms|
The following textbook is assigned to this course:
The following resources are available for students to use.
Review the course website for more information
The following are examinations from prior semesters: