CISC5835, Algorithms for Big Data,
Fall 2020

     

Home

Schedule
  & Notes

Syllabus

 
 

Overview: This course is an introduction to algorithms, especially those that are essential to data science. This course covers algorithms for sorting and searching, as well as greedy algorithms, dynamic programming, and graph algorithms. In addition, this course will focus on time and space analysis of algorithms (including big-O time and space analysis), recurrences, loop invariants, lower bounds, hashing, and NP-completeness. Some advanced data structures—such as trees, stacks, and queues—will be reviewed.

Prerequisites: CISC 5380. Programming with Python or equivalent

Instructor: Xiaolan Zhang
       Department of Computer and Information Science
       xzhang@fordham.edu

Lecture: Tuesday 5:30-7:45pm
Office hours: TBA

Course Materials:

  • Reference textbook:
    • T. Cormen, C.E. Leiserson, R. L. Rivest, Introduction to Algorithms, MIT Press (Referred to as CLR)
    • Dasgupta et al., Algorithms (McGraw-Hill, 2006). (Referred to as DPV)
  • Assigned readings from the reference textbooks.
  • Class Notes: Class notes (highly recommended) are posted on the class website. I suggest you print them out and bring them to class.

Resources: