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.
イリノイ大学アーバナ・シャンペーン校（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.
- 5 stars77.39%
- 4 stars17.46%
- 3 stars2.89%
- 2 stars0.84%
- 1 star1.40%
OBJECT-ORIENTED DATA STRUCTURES IN C++ からの人気レビュー
A truly well structured course, that knows when to guide you, but also when to let you learn the hard way. Clearest explanations of memory, c++, and object oriented design anywhere online.
Great explanations by the professor, only reason I am giving 4 stars is due to less support from course staff. Although assignments are well designed, instructions for few are confusing.
Very good course for getting around objects and classes in C++. If you are only new to the topic, this is a must. If you had any previous experience, I should give it a try as well.
Great course, simple and difficult all at the same time. Great introduction to these topics. Every thing that is included is there for a reason as every thing is straight to the point with no filler.
Accelerated Computer Science Fundamentals専門講座について
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.