COP 3503H CS II Honors

Fall 2018

Prof. Joseph J. LaViola Jr.

BHC 0131 MWF 11:30am - 12:20pm

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/20/18

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

 Cormen et al., Chapter 1

8/22/18

Getting Started
   - Insertion Sort

 Cormen et al., Chapter 2, pgs. 16-29
Insertion Sort Applet
8/24/18

Getting Started
   - Merge Sort

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

Mathematical Preliminaries
   -summations
   -logarithms and exponents
   -probability

 Cormen et al., Appendix A,C

8/29/18

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

 Cormen et al., Chapter 3

8/31/18

Solving Recurrences
   -iteration method
   -substitution method
   -master method

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


9/5/18

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

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

9/7/18

Divide and Conquer
   -Strassen's algorithm


9/10/18

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

 Cormen et al., Chapter 6
HeapSort Applet 1
9/12/18

QuickSort
   - randomized partitioning
   - average case analysis

 Cormen et al., Chapter 7
QuickSort Applet 1
QuickSort Applet 2
9/14/18

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

 Cormen et al., Chapter 8 Homework 2
 Counting Sort Applet
Bucket Sort Applet
Radix Sort Applet
9/17/18

Order statistics
   - minimum/maximum
   - selection

 Cormen et al., Chapter 9

9/19/18

Dynamic Programming
   - rod cutting

 Cormen et al., Chapter 15, pgs. 359-370

9/21/18 Teach me Friday!
Homework 3
9/24/18

Dynamic Programming
   - matrix chain mutliplication

 Cormen et al., Chapter 15, pgs. 370-377
Matrix Chain Animation
9/26/18

Dynamic Programming
   - longest common subequence

 Cormen et al., Chapter 15, pgs. 390-397
LCS applet
9/28/18

Dynamic Programming
   - optimal binary search tree

 Cormen et al., Chapter 15, pgs. 397-404 Homework 4
10/1/18

Dynamic Programming
   - optimal BST cont'd


10/3/18

Dynamic Programming
   - finishing up

 Cormen et al., Chapter 15, pgs. 378-389

10/5/18

Greedy Algorithms
   - elements of greedy strategy
   - Huffman codes

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

Greedy Algorithmsg
   - finishing up


10/10/18

Elementary Graph Algorithms
   - breadth first search
   - depth first search

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

Teach Me Friday!


10/15/18

Elementary Graph Algorithms
   - strongly connected components

 Cormen et al., Chapter 22, pgs. 615-621
Connected Component Applet
10/17/18

Minimum Spanning Trees
   - constucting a MST

 Cormen et al., Chapter 23, pgs. 624-629

10/19/18

Minimum Spanning Trees
   - constucting a MST cont'd
Homework 5
10/22/18

Minimum Spanning Trees
   - Kruskal's algorithm

 Cormen et al., Chapter 23, pgs. 631-633
Kruskal Applet
10/24/18

Minimum Spanning Trees
   - Prim's algorithm

 Cormen et al., Chapter 23, pgs. 634-636
Prim Applet
10/26/18 Guest Lecture -- Andres Vargas


10/29/18

Single Source Shortest Paths
   - Shortest Path properties

 Cormen et al., Chapter 24, pgs. 643-650

10/31/18

Single Source Shortest Paths
   - Bellman-Ford

 Cormen et al., Chapter 24, pgs. 651-657
Bellman-Ford Applet
11/2/18

Single Source Shortest Paths
   - Dijkstra

 Cormen et al., Chapter 24, pgs. 658-664 Homework 6
 Dijkstra Applet
11/5/18

All-Pairs Shortest Paths
   - shortest path and matrix multiplication

 Cormen et al., Chapter 25, pgs. 684-691

11/7/18

All-Pairs Shortest Paths
   - Floyd-Warshall

 Cormen et al., Chapter 25, pgs. 693-699
Floyd-Warshall Applet
11/9/18 Teach me Friday!
Homework 7
11/12/18 Veteran's Day - No class


11/14/18

Maximum Flow
   - preliminaries

 Cormen et al., Chapter 26, pgs. 708-714

11/16/18

Maximum Flow
   - Ford-Fulkerson

 Cormen et al., Chapter 26, pgs. 714-731
Ford-Fulkerson Applet
11/19/18

Maximum Flow
   - Maximum Bipartite matching

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

No Class


11/23/18

Holiday -- No Class


11/26/18

Parallel Algorithms

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

11/28/18

Parallel Algorithms

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

11/30/18

Finish Parallel Algorithms