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.
Filter Courses within "Data Structures and Algorithms Professional Certificate" (Click to filter)
Reset Filters | Advanced Global Search
Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues (edX) EdX
Georgia Institute of Technology,GTx

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

CS: Programming Computer Science

Dive into the core concepts of data storage and manipulation with our Data Structures & Algorithms I course. This edX offering provides a hands-on approach to learning about Arrays, ArrayLists, LinkedLists, Stacks, and Queues. Through engaging visualizations and practical exercises, you'll gain a deep understanding of how these structures work, their performance characteristics, and how to implement them effectively.

Self Paced
Self-Paced
Algorithms Data Structures Java Programming
Details
Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps (edX) EdX
Georgia Institute of Technology,GTx

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

Computer Science

Dive deep into the world of complex data structures with our Data Structures & Algorithms II course. Learn about Binary Trees, Heaps, SkipLists, and HashMaps to enhance your programming skills and understand how to efficiently manage large datasets. This course is designed for those who want to take their knowledge beyond basic algorithms.

Self Paced
Self-Paced
Algorithms Data Structures BST
Details
Data Structures & Algorithms III: AVL and 2-4 Trees, Divide and Conquer Algorithms (edX) EdX
Georgia Institute of Technology,GTx

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

Computer Science

Expand your knowledge of complex tree data structures with this course on AVL and (2-4) trees. Learn how to balance these intricate structures and implement effective operations. Delve into the world of Divide and Conquer algorithms, starting from simple iterative sorts and progressing to more sophisticated techniques that enhance efficiency in sorting tasks.

Self Paced
Self-Paced
Algorithms Data Structures Selection
Details
Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms (edX) EdX
Georgia Institute of Technology,GTx

Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms (edX)

Computer Science

Dive deep into advanced algorithms with this specialized course on edX. From pattern matching to graph theory, learn essential techniques like KMP, Rabin-Karp, Dijkstra’s Shortest Path, Minimum Spanning Tree (MST) construction, and Dynamic Programming. Enhance your problem-solving skills with practical examples and visualizations.

Self Paced
Self-Paced
Algorithms Data Structures Dynamic Programming
Details
Page 1