When you enroll through our links, we may earn a small commission—at no extra cost to you. This helps keep our platform free and inspires us to add more value.

The Georgia Institute of Technology logo

Data Structures and Algorithms

Professional Certificate programs are series of courses designed by industry leaders and top universities to build and enhance critical professional skills needed to succeed in todays most in-demand fields.

     0 |
  • Reviews ( 0 )
Free

This Course Includes

  • iconedx
  • icon0 (0 reviews )
  • icon5 months at 9 - 10 hours per week
  • iconenglish
  • iconOnline - Self Paced
  • iconprofessional certificate
  • iconThe Georgia Institute of Technology

About Data Structures and Algorithms

GTx's Data Structures and Algorithms Professional Certificate

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

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

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

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

Job Outlook

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 and Heaps. Examine tree operations & algorithms. Implement a HashMap that uses 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..