# Data Structures and Algorithms Professional Certificate

What you will learn:
- Learn how to differentiate between linear data structures like linkedlists, arrays, arraylists, stacks, and queues, and select the correct structure for a given situation. Analyze data structure performance with the course visualization tool.
- Visualize and study nonlinear/hierarchical data structures such as binary trees, BSTs, & heaps. Examine tree operations & algorithms. Implement Hashmaps that use key-value pairs to store data. Explore probabilistic data structures like Skiplists.
- To differentiate between complex tree data structures, like AVL and (2-4) trees, understand their self-balancing techniques and implementations. Visualize and examine various Divide and Conquer sorting algorithms along with their performance.
- Analyze & implement various Pattern Matching algorithms from KMP to Rabin-Karp. Study essential graph traversal algorithms in order to implement Dijkstra’s Shortest Path, and construct Minimum Spanning Trees. Delve in dynamic programming.

Sort options

## Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues (edX)

Self Paced
Course Auditing
Categories
Effort
Languages
Work with the principles of data storage in Arrays, ArrayLists & LinkedList nodes. Understand their operations and performance with visualizations. Implement low-level linear, linked data structures with recursive methods, and explore their edge cases. Extend these structures to the Abstract Data Types, Stacks, Queues and [...]

## Data Structures & Algorithms III: AVL and 2-4 Trees, Divide and Conquer Algorithms (edX)

Self Paced
Course Auditing
Categories
Effort
Languages
Learn more complex tree data structures, AVL and (2-4) trees. Investigate the balancing techniques found in both tree types. Implement these techniques in AVL operations. Explore sorting algorithms with simple iterative sorts, followed by Divide and Conquer algorithms. Use the course visualizations to understand the [...]

## Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps (edX)

Self Paced
Course Auditing
Categories
Effort
Languages
Become familiar with nonlinear and hierarchical data structures. Study various tree structures: Binary Trees, BSTs and Heaps. Understand tree operations and algorithms. Learn and implement HashMaps that utilize key-value pairs to store data. Explore probabilistic data structures like SkipLists. Course tools help visualize the structures and [...]