Discusion/Lab

Date Topic Materials
01/28/20 Discussion 1: Stable matching and the Gale‐Shapley algorithm. slides by Jon Dickerson
01/30/20 Lab 1: Coding the Gale-Shapley algorithm. Gale-Shapley C code
02/06/20 Discussion 2: Heapsort algorithm. CLRS 6
02/06/20 Lab 2: Coding the Heapsort algorithm. Heapsort C code
02/13/20 Discussion 3: Counting sort and bucketsort algorithms. CLRS 8
02/13/20 Lab 3: Coding the Counting sort algorithm. CountingSort C code
02/13/20 Lab 3: Coding the Bucket sort algorithm. Bucketsort C code
02/20/20 Discussion/Lab 4: Divide and Concquer algorithms (Find the median of two sorted arrays). https://www.geeksforgeeks.org/median-of-two-sorted-arrays/
02/26/20 Discussion 5: Pseudo Polynomial Time Dynamic Propramming (Knapsack and Partition problem). https://en.wikipedia.org/wiki/Pseudo-polynomial_time http://enee351.github.io/discussions/dp-knapsack.pdf https://en.wikipedia.org/wiki/Partition_problem#Pseudo-polynomial_time_algorithm
02/26/20 Lab 5: Coding the Knapsack algorithm. Knapsack C code
02/26/20 Lab 5: Coding the Partition algorithm. Partition C code