COMP 550: Algorithm and Analysis

General Information

  • Instructor
    Shareef Ahmed
    Lectures
    MW 4:00pm-5:15pm, Davie 112
    Office Hours
    M 2:00pm-3:30pm (SN324), Th 9:00am-11:00am (zoom), and by appointment
    LA Office Hours
    Zhehao: Mon 9:30am-12:30pm (zoom), Wed 9:30am-12:30pm (SN136)
    Oliver: MonWed 1:30pm-3:30pm (SN136), TuesThurs: 3:30pm-4:30pm (SN136)
    Canvas
    https://uncch.instructure.com/courses/34716
    Syllabus
    pdf

Schedule

# Date Topic Materials HW/Quiz
1 Aug 21 (Mon) Introduction ppt
2 Aug 23 (Wed) Algorithm correctness and runtime ppt, pdf [CLRS: Secs 2.1 and 2.2]
3 Aug 28 (Mon) Condition 3: No class
4 Aug 30 (Wed) Condition 3: No class
5 Sep 6 (Wed) Algorithm correctness and runtime (cont'd) Same as Lec 2 HW1 announced
6 Sep 11 (Mon) Algorithm correctness and runtime (cont'd) Same as Lec 2
7 Sep 13 (Wed) Condition 3: No class
8 Sep 18 (Mon) Algorithm correctness and runtime (cont'd), Asymptotic analysis ppt, pdf [CLRS: Sec 3]
9 Sep 20 (Wed) Asymptotic analysis (cont'd) HW1 due, HW2 announced
10 Sep 27 (Wed) Asymptotic analysis (cont'd), Divide and Conquer
11 Oct 2 (Mon) Divide and Conquer: Merge Sort ppt, pdf [CLRS: Secs 2.2 and 4]
12 Oct 4 (Wed) Divide and Conquer(cont'd): Closest pair of points, Recurrence relations HW2 Due, HW3 announced
13 Oct 9 (Mon) Recurrence relations (cont'd): Substitution and recursion tree ppt, pdf [CLRS: Sec 4]
14 Oct 11 (Wed) Midterm 1
15 Oct 16 (Mon) Recurrence relations (cont'd): Master method, Sorting algorithm
16 Oct 18 (Wed) Sorting Algorithms(cont'd) ppt, pdf [CLRS: Secs 6-9] HW3 due
17 Oct 23 (Mon) Greedy Algorithms ppt, pdf [CLRS: Sec 15] HW4 announced
18 Oct 25 (Wed) Greedy Algorithms (cont'd) ppt, pdf [CLRS: Sec 15]
19 Oct 30 (Mon) Greedy Algorithms (cont'd), Dynamic Programming (Cont'd) ppt, pdf [CLRS: Sec 14]
20 Nov 1 (Wed) Dynamic Programming (Cont'd)
21 Nov 6 (Mon) Dynamic Programming (Cont'd) ppt, pdf [CLRS: Sec 14] HW4 due, HW5 announced
22 Nov 8 (Wed) Dynamic Programming (cont'd), Graph Algorithms ppt, pdf [CLRS: Sec 20]
23 Nov 13 (Mon) Midterm 2
24 Nov 15 (Wed) Graph Algorithms (Shortest Paths) ppt, pdf [CLRS: Sec 22, 23]
25 Nov 20 (Mon) Graph Algorithms (Shortests Paths, MSTs) ppt, pdf [CLRS: Sec 21] HW5 due
26 Nov 27 (Mon) Graph Algorithms (MST, Max Flow)
27 Nov 29 (Wed) Hashing
28 Dec 4 (Mon) NP-completeness
29 Dec 6 (Wed) NP-completeness (cont'd), Approximation algorithms, misc (if time allows) HW6 due

Assignments

  • Assignment 1
    pdf
    Assignment 2
    pdf
    Assignment 3
    pdf
    Assignment 4
    pdf
    Assignment 5
    pdf
    Assignment 6
    pdf