CISC5835, Algorithms for Big Data, Fall 2020 |
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 Lecture: Tuesday 5:30-7:45pm
Course Materials:
Resources:
|
||