Accelerated Computer Science Fundamentals

University of Illinois at Urbana-Champaign

Accelerated Computer Science Fundamentals is a Specialization designed to prepare prospective applicants for the Online Master of Computer Science entrance exam. This sequence covers fundamental topics such as object-oriented programming, algorithmic run times, and the implementation of data structures.

Through this Specialization, learners will gain the skills to design and implement object-oriented programs in C++, select and implement appropriate data structures, and analyze the running time and space needs of algorithms. The course aims to provide the foundational knowledge required to prepare for advanced computer science courses.

  • Learn to design and implement object-oriented programs in C++
  • Understand the selection and implementation of appropriate data structures
  • Analyze algorithm running time and space needs to ensure scalability
  • Prepare for advanced computer science courses with foundational knowledge

Certificate Available ✔

Get Started / More Info
Accelerated Computer Science Fundamentals
Course Modules

This Specialization covers object-oriented programming in C++, ordered data structures, and unordered data structures. Students will learn to implement and analyze a variety of data structures and algorithms.

Object-Oriented Data Structures in C++

Object-Oriented Data Structures in C++ is the first course in the Specialization, focusing on teaching learners how to write programs in C++. This module covers setting up a development environment for writing and debugging C++ code and implementing data structures as C++ classes.

Ordered Data Structures

Ordered Data Structures introduces new data structures for efficiently storing and retrieving ordered data. Topics covered include arrays, linked lists, queues, stacks, trees, binary trees, AVL trees, B-trees, and heaps. Learners will also gain an understanding of algorithm complexity analysis and how these data structures enable efficient search and data sorting algorithms.

Unordered Data Structures

Unordered Data Structures covers the implementation of hash tables, disjoint sets, and graphs. Learners will explore fundamental data structures useful for handling unordered data, including immediate access to data indexed by an arbitrary key value and representing relationships between items. The course also covers various graph representation methods and algorithms for traversing graphs and finding the shortest route between nodes.

More Algorithms Courses

Machine Learning: Algorithms in the Real World

Alberta Machine Intelligence Institute

Machine Learning: Algorithms in the Real World is a comprehensive specialization that equips professionals with the skills to define, train, and maintain successful...

Big-O Time Complexity in Python Code

Coursera Project Network

Learn to analyze algorithms and visualize their performance using matplotlib Pyplot. Understand Big-O time complexity by analyzing Bubble sort and Binary Search...

Excel/VBA for Creative Problem Solving, Part 2

University of Colorado Boulder

"Excel/VBA for Creative Problem Solving, Part 2" enhances Excel skills with VBA, focusing on arrays, text strings, worksheet iteration, and user forms....

The Blockchain

University of California, Irvine

Begin your journey into blockchain technology and cryptofinance. Delve into distributed digital systems and their application in the blockchain. Hands-on practice...