The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
About this Course
학습자 경력 결과
공유 가능한 수료증
완료하는 데 약 12시간 필요
학습자 경력 결과
공유 가능한 수료증
완료하는 데 약 12시간 필요
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 stars
- 4 stars
- 3 stars
- 2 stars
- 1 star
GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING의 최상위 리뷰
One of the best courses to make a student learn DP in a way that enables him/her to think of the subproblems and way to proceed to solving these subproblems. Definitely helpful for me. Thanks.
As usual with Stanford and Tim Roughgarden, a high-quality course with an informal style but a lot of rigor. The assignments are challenging but doable. Highly recommended.
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.
Very well explained and I learned a lot from the course. Recommended to anyone for learning Algorithms. Some of the problem sets make you think outside the box.
Great learning experience!!!\n\nI love dynamic p the most.\n\nAssignment 4 is so challenging that it takes me a week to finish the program and debug it!!!
A bit more difficult course comparing to the first two parts. Be prepared to spend more times on problem solving and programming assignments.
I love how clear the videos (and notes) are and re-watching them really helped a lot! I wish there was more discussion on the forms though!
Fantastic course that covered a good variety of content in sufficient details and delves into the fundamentals without sacrificing clarity.
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
A more explanatory answer sheet would be helpful. Might need to be secured via limited time login session to avoid leaking on the web.
More difficult than previous sections of the course, but thoroughly enjoyable. Looking forward to the final iteration of this series!
Outstanding course. Prof. Roughgarden is enthusiastic. The lectures, programming problems, and readings build a solid understanding.
Course is great. However, for me, there's some lecture I cannot understand so I have to find another course with more explanation.
While i thought the algorithms are very good - It could use just a small amount of expansion on the specifics and background.
Great Pace - good examples - always going to the point - clear and providing good info in regards to the subject in study.
It's nice. Teacher can give me inspirations from different point of views, which teaches me a lot. Thanks!
Great material, explained very well, but the lack of feedback on tough problem sets can be frustrating;
Great material and love the professor, Tim. Some quiz questions are tricky, but liked it overall.
I am really satisfied by the course .....just love the lecture and slides too :) .....
This course is harder than the previous two in the specialization but equally fun.
알고리즘 전문 분야 정보
자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
강좌에 등록하면 바로 모든 비디오, 테스트 및 프로그래밍 과제(해당하는 경우)에 접근할 수 있습니다. 상호 첨삭 과제는 이 세션이 시작된 경우에만 제출하고 검토할 수 있습니다. 강좌를 구매하지 않고 살펴보기만 하면 특정 과제에 접근하지 못할 수 있습니다.
이 전문 분야를 구독하면 무엇을 이용할 수 있나요?
강좌를 등록하면 전문 분야의 모든 강좌에 접근할 수 있고 강좌를 완료하면 수료증을 취득할 수 있습니다. 전자 수료증이 성취도 페이지에 추가되며 해당 페이지에서 수료증을 인쇄하거나 LinkedIn 프로필에 수료증을 추가할 수 있습니다. 강좌 내용만 읽고 살펴보려면 해당 강좌를 무료로 청강할 수 있습니다.
환불 규정은 어떻게 되나요?
재정 지원을 받을 수 있나요?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.