The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).
이 강좌에 대하여
귀하가 습득할 기술
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
- 5 stars85.25%
- 4 stars12.93%
- 3 stars1.16%
- 2 stars0.51%
- 1 star0.12%
SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM의 최상위 리뷰
Thank you do much, this has been an amazing journey! Best Algorithms course online 11/10!
I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
Excellent course! The lectures provide clear and rigorous explanations, and the coding exercises are appropriately challenging.
알고리즘 특화 과정 정보
Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.
자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
이 전문 분야를 구독하면 무엇을 이용할 수 있나요?
재정 지원을 받을 수 있나요?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.