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

In this module the student will learn the very basics of algorithms through three examples: insertion sort (sort an array in ascending/descending order); binary search: search whether an element is ...

This course is compulsory on the BSc in Data Science. This course is available on the BSc in Mathematics and Economics, BSc in Mathematics with Economics and BSc in Mathematics, Statistics and ...

Covers algorithms and their performance analysis, data structures, abstraction, and encapsulation. Introduces stacks, queues, linked lists, trees, heaps, priority queues, and hash tables, and their ...

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

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