Hey readers ,Want to learn the DSA ( data structure and algorithm ) from beginner to Advanced in any programming language .then ready for it .
Google has announced the DSA courses which contain content of data structure and algorithm from beginner to advanced . the Instructor to this course is from the google employee .google will help you to build you thinking to solve the complicated problem .also this course will help you to get placed in google because the google will thought the content which are used by the google maximally. The Google is best IT company in world.
The Course content all data structure :
from arrays , link list ,queue to the Binary trees , Graphs and more
What You Will Learn
- Introduction and Efficiency
- Basic introduction to topics covered in this course.
- Leand the definition of efficiency as well as an explanation of the notation commonly used to describe efficiency.
- Practice describing efficiency with code snippets.
- List-Based Collections
- Learn the formal definition of a list, see definitions and examples of list-based data structures, arrays, linked lists, stacks, and queues.
- Examine the efficiency of common list methods, and practice using and manipulating these data structures.
- Searching and Sorting
- Explore how to search and sort with list-based data structures, including binary search and bubble, merge, and quick sort.
- Examine the efficiency of each and learn how to use recursion in searching and sorting.
- See and write examples of these methods, as well as more sorting algorithms like insertion sort.
- Maps and Hashing
- Understand the concepts of sets, maps (dictionaries), and hashing.
- Examine common problems and approaches to hashing, and practice with examples of hash tables and hash maps.
- Learn the concepts and terminology associated with tree data structures.
- Investigate common tree types, such as binary search trees, heaps, and self-balancing trees.
- See examples of common tree traversal techniques, examine the efficiency of traversals and common tree functions, and practice manipulating trees.
- Examine the theoretical concept of a graph and understand common graph terms, coded representations, properties, traversals, and paths.
- Practice manipulating graphs and determining the efficiency associated with graphs.
- Case Studies in Algorithms
- Explore famous computer science problems, specifically the Shortest Path Problem, the Knapsack Problem, and the Traveling Salesman Problem.
- Learn about brute-force, greedy, and dynamic programming solutions to such problems.
- Technical Interviewing Techniques
- Learn about the “algorithm” for answering common technical interviewing questions.
- See how to clarify and explain practice interview questions using the concepts taught in this course, and get tips for giving interviewers exactly what they’re looking for in an interview.
- Use Pramp to meet with another Udacity student and get live technical interview practice.
- Prerequisites and Requirements
- Proficient in spoken and written English
- Python (intermediate)
- Algebra (intermediate)
- See the Technology Requirements for using Udacity.