COP 3503H CS II Honors

Fall 2021

Prof. Joseph J. LaViola Jr.

BHC 129 MW 10:30am - 11:45am

Welcome to COP 3503H! -- Homework 8 is posted!

Course Syllabus and Info

Some Lecture Notes courtesy of Arup Guha

Date Lecture Description Readings Assignments Resources
8/23/21

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

Getting Started
   - Insertion Sort

 Cormen et al., Chapter 1
Cormen et al., Chapter 2, pgs. 16-29
Insertion Sort Applet
8/25/21

Getting Started
   - Merge Sort

 Cormen et al., Chapter 2, pgs. 29-39
Merge Sort Animation 1
Merge Sort Animation 2
8/30/21

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
Cormen et al., Chapter 3

9/1/21

Solving Recurrences
   -iteration method
   -substitution method
   -master method

 Cormen et al., Chapter 4, pgs. 83-97
 Homework 1
9/6/21 Holiday -- No class


9/8/21

Divide and Conquer
   -maximum-subarray
   -Strassen's algorithm

 Cormen et al., Chapter 4, pgs. 68-82

9/13/21

Divide and Conquer
   -Strassen's algorithm

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

 Cormen et al., Chapter 6
HeapSort Applet 1
9/15/21

QuickSort
   - randomized partitioning
   - average case analysis

 Cormen et al., Chapter 7 Homework 2
 QuickSort Applet 1
QuickSort Applet 2
9/20/21

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

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

Order statistics
   - minimum/maximum
   - selection

 Cormen et al., Chapter 9 Homework 3
9/27/21

Dynamic Programming
   - rod cutting
   - matrix chain mutliplication

 Cormen et al., Chapter 15, pgs. 359-377
Matrix Chain Animation
9/29/21

Dynamic Programming
   - longest common subsequence

 Cormen et al., Chapter 15, pgs. 390-397
LCS applet
10/4/21

Dynamic Programming
   - optimal binary search tree

 Cormen et al., Chapter 15, pgs. 397-404

10/6/21

Dynamic Programming
   - optimal BST cont'd
   - finishing up

 Cormen et al., Chapter 15, pgs. 378-389 Homework 4
10/11/21

Greedy Algorithms
   - Activity Selection

 Cormen et al., Chapter 16, pgs. 414-421

10/13/21

Greedy Algorithms
   - elements of greedy strategy
   - Huffman codes

 Cormen et al., Chapter 16, pgs. 423-437 Midterm exam
 Huffman Code Applet
10/18/21

Elementary Graph Algorithms
   - breadth first search
   - depth first search

 Cormen et al., Chapter 22, pgs. 583-602
BFS Applet
DFS Applet
10/20/21

Elementary Graph Algorithms
   - strongly connected components

Minimum Spanning Trees
   - constucting a MST

 Cormen et al., Chapter 22,23 pgs. 615-629
Connected Component Applet
10/25/21

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

 Cormen et al., Chapter 23, pgs. 631-636 Homework 5
 Kruskal Applet
Prim Applet
10/27/21

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

 Cormen et al., Chapter 24, pgs. 643-657
Bellman-Ford
11/1/21

Single Source Shortest Paths
   - Dijkstra
   - Difference constraints

Cormen et al., Chapter 24, pgs. 658-668 Homework 6
 Dijkstra Applet
11/3/21

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

 Cormen et al., Chapter 25, pgs. 684-699
Floyd-Warshall Applet
11/8/21

All-Pairs Shortest Paths
   - Transitive Closure and Johnson

 Cormen et al., Chapter 25, pgs. 699-705 Homework 7
11/10/21

Maximum Flow
   - preliminaries
   - Ford-Fulkerson

 Cormen et al., Chapter 26, pgs. 708-731
Ford-Fulkerson Applet
11/15/21

Maximum Flow
   - Maximum Bipartite matching

 Cormen et al., Chapter 26, pgs. 732-735 Homework 8
11/17/21

Parallel Algorithms

 Cormen et al., Chapter 27, pgs. 772-792

11/22/21

Parallel Algorithms

 Cormen et al., Chapter 27, pgs. 792-805