(4 credits)
The course systematically studies advanced data structures and the design and analysis of algorithms. The main focuses are the techniques for designing algorithms using appropriate data structures, proving correctness, and analyzing the computational complexity of algorithms. Topics covered include: hash tables; data structures for combinatorial optimization; search trees; recurrence relations; divide and conquer; dynamic programming; greedy methods; advanced graph algorithms; linear programming. This course will be supplemented by algorithms selected from recent technical literature.
Need help from a librarian?
-Make an in-person appointment
-Book a virtual meeting
Already in the library?
Get help at the Service Desk.
Access our online FAQs to find an answer to your question.
Submit your question online to ref@oakland.edu
Questions are typically answered within 2 hours or when research help re-opens.
Call us at (248)-370-4426.
Find a librarian that is a specialist on your topic.
