Covers algorithms and their performance analysis, data structures, abstraction, and encapsulation. Introduces stacks, queues ... algorithm encapsulation using classes and templates, and how and when ...

Basic data structures: Heaps, and Binary Search Trees. Algorithm Design Approaches: Divide and Conquer including analysis using recurrences; Greedy Algorithms; Dynamic Programming Algorithms; ...

Learn when and how to use different data structures and their algorithms in your own code. This is harder as a student, as the problem assignments you'll work through just won't impart this knowledge.

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

Graduates will also be able to clearly communicate the results of data science analysis to a non-technical audience; structure effective meetings and projects using collaboration skills; and act ...