[Udacity] Data Structures and Algorithms

0

[Udacity] Data Structures and Algorithms

Description

Data Structures & Algorithms

In this course you will learn data structures and algorithms by solving 80+ practice problems. You will begin each course by learning to solve defined problems related to a particular data structure and algorithm. By the end of each course, you would be able to evaluate and assess different data structures and algorithms for any open-ended problem and implement a solution based on your design choices.

What you will learn in Data Structures and Algorithms:

  • Different types of structures that hold data.
  • Different ways to change data structures and evaluate their performance
  • Understand the benefits and applications of different data structures
  • Dealing with different issues and choosing the right data structure according to need

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.

Course specifications

Publisher:  Udacity

Instructors: Kyle Stewart-Franz , Abe Feinberg and Brynn Claypoole

English language

Level of training: basic to advanced

Duration: Assuming 10 hours of work per week, approximately 4 months

Size: 2.13 GB

Download Now

https://www.udacity.com/course/data-structures-and-algorithms-nanodegree–nd256.

Leave A Reply

Your email address will not be published.