Tentative Syllabus

Information

  • Instructor: Amarda Shehu amarda\AT\cs.gmu.edu
    Place and Time: Innovation Hall 131, W 4:30-7:10 pm
    Office Hours: ENGR #4422, W 2:30-4:30 pm

Tentative Syllabus

Date Topic Chapters Assignments
Aug 27 Course Overview and Introduction to Analysis of Algorithms C1-3, D0, D2.0-.3 [pdf] Self-eval. quizz
Sep 03 Algorithm Analysis C3-5, D2.0-.3 [pdf] Quizz
Sorting
Sep 10 Algorithm Analysis C3-5, D2.0-.3 [pdf] Quizz
Sep 17 Heapsort, Quicksort, Linear-Time Sorting C6-8, D2.3 [pdf] Quizz
Data Structures for Searching and Mapping
Sep 24 Order Statistics C9, D1.5, [pdf] Quizz
Oct 01 Hash Tables C11 [pdf] Quizz, Hw1 Out
Oct 08 Binary Search Trees, Balanced Search Trees, and Binomial Heaps C12-C13, C19 [pdf] Hw1 Due
Optimization and Advanced Analysis
Oct 15 Dynamic Programming, Greedy Algorithms C15-16, D5-6 [pdf] Quizz
Oct 22 Greedy Algorithms, Amortized Analysis C16-17, D5-6 [pdf], [pdf] Quizz
Oct 29 Exam 1 Exam 1
Graph Algorithms
Nov 05 Graph Representation, Elementary Graph Algorithms C22, D3, D6 [pdf] Hw2 Out
Nov 12 Topological Sorting, SCCs, Minimum Spanning Trees C22, D3, D6 [pdf] Quizz
Nov 19 Minimum Spanning Trees and Single-source Shortest Paths C22-23, D4 [pdf] Quizz
Dec 03 All Pairs Shortest Paths and Maximum Flow C25-26, D4.4-.7 [pdf] Hw2 Due
Dec 10 Exam 2 Innovation Hall 131 4:30 pm -- 7:15 pm