Data structures and algorithms constitute the foundational pillars of computer science. They provide the systematic methods for organising, storing and manipulating data, and offer step-by-step ...

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 Fréchet distance is a widely used measure in computational geometry for quantifying the similarity between curves. Unlike simpler metrics, it takes into account the location and ordering of points ...

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 ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...