The Foundations of Data Structures and Algorithms specialization includes two optional preparation courses and a three-course pathway to earn admission to the Online MS in Computer Science. You must ...

The student is also exposed to the notion of a faster algorithm and asymptotic complexity through the O, big-Omega and big-Theta notations. In this module, the student will learn about the basics of ...

Examines several design issues, including selection of data structures based on operations to be optimized, algorithm encapsulation using classes and templates, and how and when to use recursion.

and design of algorithms for data structure processing; binary trees, recursion; sorting, searching methods. Prerequisites: CS 214 with a grade of C- or better and MATH 128 or equivalent. IAI: CS 912.

Tour of the most important data structures, fundamental algorithms, and algorithm design techniques: lists, stacks, queues, dynamic arrays, hash tables, heaps, priority queues, disjoint set unions, ...

Tour of the most important data structures, fundamental algorithms ... maximum flow, incremental and recursive algorithms, divide-and-conquer, greedy algorithms. This course is delivered through a ...

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