COP 3503H CS II Honors

Fall 2022

Prof. Joseph J. LaViola Jr.

ENG1 383 MW 10:30am - 11:45am

Welcome to COP 3503H! -- HW8 has posted!

Course Syllabus and Info

Some Lecture Notes courtesy of Arup Guha

Date Lecture Description Readings Assignments Resources
8/22/22

Introduction
   -course mechanics
   -role of algorithms
   -role of analysis

Getting Started
   - Insertion Sort

 Cormen et al., Chapter 1
Cormen et al., Chapter 2, pgs. 17-34
Insertion Sort Applet
8/24/22

Getting Started
   - Merge Sort

 Cormen et al., Chapter 2, pgs. 34-48
Merge Sort Animation 1
Merge Sort Animation 2
8/29/22

Mathematical Preliminaries
   -summations
   -logarithms and exponents

Growth of Functions
   -theta notation
   -big and little o notation
   -big and little omega notation

 Cormen et al., Appendix A,C,D
Cormen et al., Chapter 3

8/31/22

Solving Recurrences
   -iteration method
   -substitution method
   -master method

 Cormen et al., Chapter 4, pgs. 90-107
 Homework 1
9/5/22 Holiday -- No class


9/7/22

Divide and Conquer
   -matrix multiplication
   -Strassen's algorithm

 Cormen et al., Chapter 4, pgs. 80-90

9/12/22

Heap Sort
   -Heap property
   -Building a heap
   -Priority Queues

 Cormen et al., Chapter 6
HeapSort Applet 1
9/14/22

QuickSort
   - randomized partitioning
   - average case analysis

 Cormen et al., Chapter 7 Homework 2
 QuickSort Applet 1
QuickSort Applet 2
9/19/22

Linear time sorting
   - counting sort
   - radix sort
   - bucket sort

 Cormen et al., Chapter 8
Counting Sort Applet
Bucket Sort Applet
Radix Sort Applet
9/21/22

Order statistics
   - minimum/maximum
   - selection

 Cormen et al., Chapter 9 Homework 3
9/26/22

Dynamic Programming
   - rod cutting
   - matrix chain mutliplication

 Cormen et al., Chapter 14, pgs. 362-382
Matrix Chain Animation
9/28/22 Hurricane -- No class


10/3/22 Hurricane -- No class


10/5/22

Dynamic Programming
   - longest common subsequence

 Cormen et al., Chapter 14, pgs. 393-399
LCS applet
10/10/22

Dynamic Programming
   - optimal binary search tree

 Cormen et al., Chapter 14, pgs. 400-406 Homework 4
10/12/22

Dynamic Programming
   - optimal BST cont'd
   - finishing up

 Cormen et al., Chapter 14, pgs. 382-392

10/17/22

Greedy Algorithms
   - Activity Selection

 Cormen et al., Chapter 15, pgs. 417-425 Midterm exam
10/19/22

Greedy Algorithms
   - elements of greedy strategy
   - Huffman codes

 Cormen et al., Chapter 15, pgs. 426-439
Huffman Code Applet
10/24/22

Elementary Graph Algorithms
   - breadth first search
   - depth first search

 Cormen et al., Chapter 20, pgs. 549-572
BFS Applet
DFS Applet
10/26/22

Elementary Graph Algorithms
   - strongly connected components

Minimum Spanning Trees
   - constucting a MST

 Cormen et al., Chapter 20,21 pgs. 573-591
Connected Component Applet
10/31/22

Minimum Spanning Trees
   - Kruskal's algorithm
   - Prim's algorithm

 Cormen et al., Chapter 21, pgs. 591-597 Homework 5
 Kruskal Applet
Prim Applet
11/2/22

Single Source Shortest Paths
   - Shortest Path properties
   - Bellman-Ford

 Cormen et al., Chapter 22, pgs. 604-616
Bellman-Ford
11/7/22

Single Source Shortest Paths
   - Dijkstra
   - Difference constraints

Cormen et al., Chapter 22, pgs. 616-631 Homework 6
 Dijkstra Applet
11/9/22 Sigh...Hurricane -- No class


11/14/22

All-Pairs Shortest Paths
   - shortest path and matrix multiplication
   - Floyd-Warshall

 Cormen et al., Chapter 23, pgs. 646-661 Homework 7
 Floyd-Warshall Applet
11/16/22

Maximum Flow
   - preliminaries
   - Ford-Fulkerson

 Cormen et al., Chapter 24, pgs. 670-689
Ford-Fulkerson Applet
11/21/22

Maximum Flow
   - Maximum Bipartite matching

 Cormen et al., Chapter 24, pgs. 693-696 Homework 8
11/28/22

Parallel Algorithms

 Cormen et al., Chapter 26, pgs. 748-770

11/30/22

Parallel Algorithms

 Cormen et al., Chapter 26, pgs. 770-775