Computing and Software Systems 343, Spring 2004
Mathematical Principles of Computing II

Slides and Notes

Note: All slides are modified versions of the slides created by the book author, Tamassia & Goodrich. Directory of all slides

• Week 1: analysis slides; data structures slides
• Week 2: more data structures slides ; Divide and Conquer and Mergesort slides
• Week 3: Sorting slides.
• Week 6: Dynamic Programming slides.
• Week 7: Greedy Algorithms slides. Graph Intro slides. Graph Intro Problems slides.
• Week 8: Graph algorithms: DFS, BFS, Topological Sort slides.
• Week 9: More graph algorithms: Floyd-Warshall slides. Shortest Path slides. Minimum Spanning Tree slides.
• Last week: More stuff slides