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++.
提供：
Accelerated Computer Science Fundamentals専門講座イリノイ大学アーバナ・シャンペーン校（University of Illinois at Urbana-Champaign）学習内容
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.
習得するスキル
この専門講座について
22,323 最近の表示
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時間/週
英語
字幕：英語, アラビア語, フランス語, ポルトガル語（ヨーロッパ）, 中国語（簡体）, イタリア語, ベトナム語, 韓国語, ドイツ語, ロシア語, トルコ語, スペイン語
共有できる証明書
修了時に証明書を取得
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時間/週
英語
字幕：英語, アラビア語, フランス語, ポルトガル語（ヨーロッパ）, 中国語（簡体）, イタリア語, ベトナム語, 韓国語, ドイツ語, ロシア語, トルコ語, スペイン語
この専門講座には3コースあります。
Object-Oriented Data Structures in C++
1,766件の評価
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
555件の評価
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
355件の評価
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.
提供：
イリノイ大学アーバナ・シャンペーン校（University of Illinois at Urbana-Champaign）
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.
よくある質問
返金ポリシーについて教えてください。
1つのコースだけに登録することは可能ですか？
学資援助はありますか？
無料でコースを受講できますか？
このコースは100%オンラインで提供されますか？実際に出席する必要のあるクラスはありますか？
専門講座を修了することで大学の単位は付与されますか？
専門講座を修了することで大学の単位は付与されますか？
Do I need to take the courses in a specific order?
さらに質問がある場合は、受講者向けヘルプセンターにアクセスしてください。
