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.
Об этом курсе
Иллинойсский университет в Урбане-Шампейне
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 stars
- 4 stars
- 3 stars
- 2 stars
- 1 star
Лучшие отзывы о курсе OBJECT-ORIENTED DATA STRUCTURES IN C++
Honestly, this is a great crash course in OOP for C++ (though the ideas can be applied to any language). Previous experience with C++ is almost a necessity, the lessons can be complicated for novices.
I enjoyed this course so much! Explanations were very clear and now i feel like i can navigate c++ code much easier! It has made me eager to keep exploring this awesome language and data structures!
I felt this mini-course was well-organized and to the point. Prof. Fagen-Ulmschneider covered all the necessary details with great emphasis. I appreciate Prof. F's enthusiasm for the topic.
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.
Специализация 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.