AlgorithmsDynamic ProgrammingGreedy AlgorithmDivide And Conquer AlgorithmsRandomized AlgorithmSorting AlgorithmGraphsData StructureHash TableSpanning TreeNp-Completeness
算法 專項課程
Learn To Think Like A Computer Scientist. Master the fundamentals of the design and analysis of algorithms.
提供方
算法 專項課程斯坦福大学您將獲得的技能
關於此 專項課程
114,577 次近期查看
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.
About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.
應用的學習項目
Learners will practice and master the fundamentals of algorithms through several types of assessments. Every week, there is a multiple choice quiz to test your understanding of the most important concepts. There are also weekly programming assignments, where you implement one of the algorithms covered in lecture in a programming language of your choosing. Each course concludes with a multiple-choice final exam.
學生職業成果
62%
完成此 專項課程 後開始了新的職業。
20%
加薪或升職。
可分享的證書
完成後獲得證書
100% 在線課程
立即開始，按照自己的計劃學習。
靈活的計劃
設置並保持靈活的截止日期。
中級
需要一些相關領域經驗。需要一些相關經驗。
完成時間大約為4 個月
建議 4 小時/週
英語（English）
字幕：英語（English）, 阿拉伯語（Arabic）, 法語（French）, （歐洲人講的）葡萄牙語, 中文（簡體）, 意大利語, 越南語, 韓語, 德語（German）, 俄語（Russian）, 土耳其語（Turkish）, 西班牙語（Spanish）
學生職業成果
62%
完成此 專項課程 後開始了新的職業。
20%
加薪或升職。
可分享的證書
完成後獲得證書
100% 在線課程
立即開始，按照自己的計劃學習。
靈活的計劃
設置並保持靈活的截止日期。
中級
需要一些相關領域經驗。需要一些相關經驗。
完成時間大約為4 個月
建議 4 小時/週
英語（English）
字幕：英語（English）, 阿拉伯語（Arabic）, 法語（French）, （歐洲人講的）葡萄牙語, 中文（簡體）, 意大利語, 越南語, 韓語, 德語（German）, 俄語（Russian）, 土耳其語（Turkish）, 西班牙語（Spanish）
此專項課程包含 4 門課程
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
4,318 個評分
The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
Graph Search, Shortest Paths, and Data Structures
1,747 個評分
The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
1,091 個評分
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).
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
700 個評分
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.
常見問題
完成专项课程后我会获得大学学分吗？
Can I just enroll in a single course?
我可以只注册一门课程吗？
Can I take the course for free?
我可以免费学习课程吗？
此课程是 100% 在线学习吗？是否需要现场参加课程？
完成专项课程需要多长时间？
Do I need to take the courses in a specific order?
Will I earn university credit for completing the Specialization?
完成专项课程后我会获得大学学分吗？
還有其他問題嗎？請訪問 學生幫助中心。
