Building fast and highly performant data science applications requires an intimate knowledge of how data can be organized in a computer and how to efficiently perform operations such as sorting, ...

The design, implementation, and analysis of abstract data types, data structures and their algorithms. Topics include: data and procedural abstraction, amortized data structures, trees and search ...

This course is available with permission to General Course students. Introduction to the fundamental principles of data structures and algorithms and their efficient implementation. Developing ...

This will also be an introduction to the role of randomization in algorithm design. Next, we will study hashtables: a highly useful data structure that allows for efficient search and retrieval from ...

An introduction to the analysis and implementation of algorithms and data structures including linear data structures, trees, graphs, hash tables, searching algorithms, sorting algorithms, ...