Data Structures and Algorithms

بواسطة: Udacity

Overview

This program will help you gain an in-depth understanding of data structures and algorithms through 100+ practice problems and dedicated mentor support. Learn by doing as you practice with both defined and open-ended questions. This practice will help you learn to design elegant solutions to new and open-ended problems.
Get hands-on practice with over 100 data structures and algorithm exercises and guidance from a dedicated mentor to help prepare you for interviews and on-the-job scenarios.

Syllabus

  • Introduction
    • Get an overview of your program. Meet your instructors, and refresh your Python skills. Learn the framework to deconstruct any open-ended problem and then understand the concepts of time and space complexity.
  • Data Structures
    • Learn different data structures that can be used to store data. Implement different methods used to manipulate these data structures and examine the efficiency. Understand the advantages and applications of different data structures. Learn how to approach open ended problems (either in interview or real-world) and select appropriate data structures based on requirements.
  • Basic Algorithms
    • Learn and implement basic algorithms such as searching and sorting on different data structures and examine the efficiency of these algorithms. Use recursion to implement these algorithms and then learn how some of these algorithms can be implemented without recursion. Practice selecting and modifying these algorithms for a variety of interview problems.
  • Advanced Algorithms
    • Build on your algorithm skills by learning more advanced algorithms such as brute-force greedy algorithms, graph algorithms, and dynamic programming which optimizes recursion by storing results to sub problems.

Taught by

Brynn Claypoole, Abe Feinberg and Kyle Stewart-Franz

Data Structures and Algorithms
الذهاب الي الدورة

Data Structures and Algorithms

بواسطة: Udacity

  • Udacity
  • مدفوعة
  • الإنجليزية
  • متاح شهادة
  • متاح في أي وقت
  • الجميع
  • N/A