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++.
提供方
您将学到的内容有
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.
您将获得的技能
关于此 专项课程
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）, 阿拉伯语（Arabic）, 法语（French）, （欧洲人讲的）葡萄牙语, 意大利语, 越南语, 德语（German）, 俄语（Russian）, 西班牙语（Spanish）
可分享的证书
完成后获得证书
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）, 阿拉伯语（Arabic）, 法语（French）, （欧洲人讲的）葡萄牙语, 意大利语, 越南语, 德语（German）, 俄语（Russian）, 西班牙语（Spanish）
此专项课程包含 3 门课程
Object-Oriented Data Structures in C++
1,847 个评分
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
574 个评分
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
370 个评分
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.
常见问题
退款政策是如何规定的？
我可以只注册一门课程吗？
有助学金吗？
我可以免费学习课程吗？
此课程是 100% 在线学习吗？是否需要现场参加课程？
完成专项课程后我会获得大学学分吗？
完成专项课程后我会获得大学学分吗？
Do I need to take the courses in a specific order?
还有其他问题吗？请访问 学生帮助中心。
