CISC5835, Algorithms for Big Data,
Fall 2020

     

Home

Schedule
  & Notes

Syllabus

Schedule

 

 
Dates Topics(Chapters) Class Notes Reading Assignment Writen/Programming Assignment
Introduction, Alg. Analysis slides (ppt, pdf), handout fib.py sort.py Chapter 0 (DPV), math background review (logarithm, khan academy on logarithms, math. induction)
Review of Data Strucgure hashing (pdf, ppt, handout) heap (visualization), heapsort) Intro to Data Structure (pdf, doc) Chapter 1 (1.1,1.2,1.5) (DPV), Chapter 12 (CLR),
Divide and Conquer: Sorting, Master Theorem slides (ppt, pdf), handout MergeSort.cpp Chapter 2 (2.1-2.5)(DPV), Section 2.3.1, Chapter 4 (CLR)
QuickSort (Selection), Counting sort, radix sort slides (pdf ppt, handout) on multiplication and exponentiation (pdf, ppt) QuickSort Explained in Python Chapter 1 (1.1,1.2,1.5) (DPV)
Graph Algorithms slides (ppt pdf, handout) A* search Chapter 3-4 (DPV), chapter 22, 22.1-22.3 (CLR) blog on graph NetworkX Reference, Graph Algorithms in Neo4j
Midterm
Dynamic Programming (pdf, ppt handout) Chapter 15 (CLR), Chapter 6 (6.2, 6.4, 6.6) (DPV)
Linear Programming slides (pdf, PPT), handout Chapter 29 (CLR), Chapter 7 (DPV)
NP-Complete Problem slides (pdf, ppt), handout
Linear Programming
NP-Completeness, Intro to Big Data Algorithms slides (Big Data (1))
Streaming algorithms slides (Big Data (2), (3))
Final Exam (cumulative) and presentation