Trees & Graphs: Basics Dynamic Programming, Greedy Algorithms This specialization can be taken for academic credit as part of CU Boulder’s MS in Data Science or MS in Computer Science degrees offered ...

Big-O, Big-Omega, Big-Theta notations, and their meanings. Basic data structures: Heaps, and Binary Search Trees. Algorithm Design Approaches: Divide and Conquer including analysis using recurrences ...