- Algorithm Design
- Python Programming
- Data Structure Design
- Analysis of Algorithms
- Hashtables
- Graphs Algorithms
- Intractability
您將學到的內容有
Organize, store and process data efficiently using sophisticated data structures and algorithms
Design algorithms and analyze their complexity in terms of running time and space usage
Create applications that are supported by highly efficient algorithms and data structures for the task at hand
Explain fundamental concepts for algorithmic searching and sorting
您將獲得的技能
關於此 專項課程
應用的學習項目
Learners will solve data-structure problems by analyzing and designing algorithms for searching, sorting, and indexing; creating trees and graphs; and addressing intractability. Courses also include conceptual algorithm design problems as well as opportunities to program data-structures/algorithms in the python programming language.
Calculus: derivatives and integrals. Probability theory: distributions, expectations, and moments. Some programming experience with Python.
Calculus: derivatives and integrals. Probability theory: distributions, expectations, and moments. Some programming experience with Python.
專項課程的運作方式
加入課程
Coursera 專項課程是幫助您掌握一門技能的一系列課程。若要開始學習,請直接註冊專項課程,或預覽專項課程並選擇您要首先開始學習的課程。當您訂閱專項課程的部分課程時,您將自動訂閱整個專項課程。您可以只完成一門課程,您可以隨時暫停學習或結束訂閱。訪問您的學生面板,跟踪您的課程註冊情況和進度。
實踐項目
每個專項課程都包括實踐項目。您需要成功完成這個(些)項目才能完成專項課程並獲得證書。如果專項課程中包括單獨的實踐項目課程,則需要在開始之前完成其他所有課程。
獲得證書
在結束每門課程並完成實踐項目之後,您會獲得一個證書,您可以向您的潛在雇主展示該證書並在您的職業社交網絡中分享。

此專項課程包含 3 門課程
Algorithms for Searching, Sorting, and Indexing
This course covers basics of algorithm design and analysis, as well as algorithms for sorting arrays, data structures such as priority queues, hash functions, and applications such as Bloom filters.
Trees and Graphs: Basics
Basic algorithms on tree data structures, binary search trees, self-balancing trees, graph data structures and basic traversal algorithms on graphs. This course also covers advanced topics such as kd-trees for spatial data and algorithms for spatial data.
Dynamic Programming, Greedy Algorithms
This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems. We will also cover some advanced topics in data structures.
提供方

科罗拉多大学波德分校
CU-Boulder is a dynamic community of scholars and learners on one of the most spectacular college campuses in the country. As one of 34 U.S. public institutions in the prestigious Association of American Universities (AAU), we have a proud tradition of academic excellence, with five Nobel laureates and more than 50 members of prestigious academic academies.
立即開始攻讀碩士學位
常見問題
退款政策是如何规定的?
我可以只注册一门课程吗?
有助学金吗?
我可以免费学习课程吗?
此课程是 100% 在线学习吗?是否需要现场参加课程?
完成专项课程需要多长时间?
What background knowledge is necessary?
Do I need to take the courses in a specific order?
完成专项课程后我会获得大学学分吗?
What will I be able to do upon completing the Specialization?
還有其他問題嗎?請訪問 學生幫助中心。