Run-time AnalysisAlgorithmsHash TableTrees (Data Structures)Object-Oriented Programming (OOP)
Accelerated Computer Science Fundamentals 專項課程
Data Structures and Algorithms in C++. Learn fundamentals of computer science while implementing efficient data structures in C++.
9,764 人已註冊
提供方
您將學到的內容有
Design and implement an object-oriented program in the C++ language, including defining classes that encapsulate data structures and algorithms.
Select and implement appropriate data structures that best utilize resources to solve a computational problem.
Analyze the running time and space needs of an algorithm, asymptotically to ensure it is appropriate at scale, including for big data.
Prepare for advanced courses in CS with the foundational knowledge of object data structures needed to implement and call advanced library functions.
您將獲得的技能
關於此 專項課程
26,909 次近期查看
Topics covered by this Specialization include basic object-oriented programming, the analysis of asymptotic algorithmic run times, and the implementation of basic data structures including arrays, hash tables, linked lists, trees, heaps and graphs, as well as algorithms for traversals, rebalancing and shortest paths.
This Specialization sequence is designed to help prospective applicants to the flexible and affordable Online Master of Computer Science (MCS) and MCS in Data Science prepare for the Online MCS Entrance Exam. The Online MCS Entrance Exam allows applicants who do not have graded and transcripted prerequisite CS coursework in the areas of data structures, algorithms, and object-oriented programming to strengthen their applications for admission. Learn more about the Online MCS Entrance Exam.
應用的學習項目
Students will solve weekly “challenge problems” by implementing fragments of C++ code in a web-based interface. Each course also features two longer-format coding projects where students will follow instructions to complete a C++ program that performs tasks such as editing images, efficiently manipulating data structures, or solving a graph search problem.
可分享的證書
完成後獲得證書
100% 在線課程
立即開始，按照自己的計劃學習。
靈活的計劃
設置並保持靈活的截止日期。
中級
Learners should be able to write a program in a programming language (e.g. Python), and preferably have taken an introductory programming course.
完成時間大約為3 個月
建議 5 小時/週
英語（English）
字幕：英語（English）
可分享的證書
完成後獲得證書
100% 在線課程
立即開始，按照自己的計劃學習。
靈活的計劃
設置並保持靈活的截止日期。
中級
Learners should be able to write a program in a programming language (e.g. Python), and preferably have taken an introductory programming course.
完成時間大約為3 個月
建議 5 小時/週
英語（English）
字幕：英語（English）
此專項課程包含 3 門課程
Object-Oriented Data Structures in C++
1,104 個評分
This course teaches learners how to write a program in the C++ language, including how to set up a development environment for writing and debugging C++ code and how to implement data structures as C++ classes. It is the first course in the Accelerated CS Fundamentals specialization, and subsequent courses in this specialization will be using C++ as the language for implementing the data structures covered in class.
Ordered Data Structures
382 個評分
In this course, you will learn new data structures for efficiently storing and retrieving data that is structured in an ordered sequence. Such data includes an alphabetical list of names, a family tree, a calendar of events or an inventory organized by part numbers. The specific data structures covered by this course include arrays, linked lists, queues, stacks, trees, binary trees, AVL trees, B-trees and heaps. This course also shows, through algorithm complexity analysis, how these structures enable the fastest algorithms to search and sort data.
Unordered Data Structures
237 個評分
The Unordered Data Structures course covers the data structures and algorithms needed to implement hash tables, disjoint sets and graphs. These fundamental data structures are useful for unordered data. For example, a hash table provides immediate access to data indexed by an arbitrary key value, that could be a number (such as a memory address for cached memory), a URL (such as for a web cache) or a dictionary. Graphs are used to represent relationships between items, and this course covers several different data structures for representing graphs and several different algorithms for traversing graphs, including finding the shortest route from one node to another node. These graph algorithms will also depend on another concept called disjoint sets, so this course will also cover its data structure and associated algorithms.
提供方
伊利诺伊大学香槟分校
The University of Illinois at Urbana-Champaign is a world leader in research, teaching and public engagement, distinguished by the breadth of its programs, broad academic excellence, and internationally renowned faculty and alumni. Illinois serves the world by creating knowledge, preparing students for lives of impact, and finding solutions to critical societal needs.
常見問題
退款政策是如何规定的？
如果订阅，您可以获得 7 天免费试听，在此期间，您可以取消课程，无需支付任何罚金。在此之后，我们不会退款，但您可以随时取消订阅。请阅读我们完整的退款政策。
我可以只注册一门课程吗？
可以！点击您感兴趣的课程卡开始注册即可。注册并完成课程后，您可以获得可共享的证书，或者您也可以旁听该课程免费查看课程资料。如果您订阅的课程是某专项课程的一部分，系统会自动为您订阅完整的专项课程。访问您的学生面板，跟踪您的进度。
有助学金吗？
是的，Coursera 可以为无法承担费用的学生提供助学金。通过点击左侧“注册”按钮下的“助学金”链接可以申请助学金。您可以根据屏幕提示完成申请，申请获批后会收到通知。您需要针对专项课程中的每一门课程完成上述步骤，包括毕业项目。了解更多。
我可以免费学习课程吗？
完成注册课程后，您可以学习专项课程中的所有课程，并且完成作业后可以获得证书。如果您只想阅读和查看课程内容，可以免费旁听该课程。如果您无法承担课程费用，可以申请助学金。
此课程是 100% 在线学习吗？是否需要现场参加课程？
此课程完全在线学习，无需到教室现场上课。您可以通过网络或移动设备随时随地访问课程视频、阅读材料和作业。
完成专项课程后我会获得大学学分吗？
此专项课程不提供大学学分，但部分大学可能会选择接受专项课程证书作为学分。查看您的合作院校了解详情。
完成专项课程后我会获得大学学分吗？
此专项课程不提供大学学分，但部分大学可能会选择接受专项课程证书作为学分。查看您的合作院校，了解详情。Coursera 上的在线学位和 Mastertrack™ 证书提供获得大学学分的机会。
Do I need to take the courses in a specific order?
It is recommended that the courses in the Specialization be taken in the order outlined.
還有其他問題嗎？請訪問 學生幫助中心。
