Developing Problem-Solving and Analytical Skills with Data Structures

Developing Problem-Solving and Analytical Skills with Data Structures

Announcing the New CodeHS Data Structures Course in C++!

Data. We see it everywhere and in many different forms from tracking customer habits, marketing and shipping orders, and even to sequence the human genome.

So how do we manage data when it doesn’t fit neatly into a list? The answer is advanced data structures and algorithms. Data structures help companies collect and organize their digital data efficiently. As our world collects more and more data, it’s our job to prepare students with the skills to improve the accuracy of data collection and storage.

Data Structures Course Overview

CodeHS is excited to announce their first C++ course — Data Structures! This course focuses on different ways to store data, beyond traditional variables and lists. In this course, students will learn about advanced data structures such as maps, queues, and sets and apply them in larger, real-world assignments and projects. View the full course overview here.

Level: High School
Prerequisite: AP CSA (or another full year language course)
Course Syllabus: codehs.com/syllabus/12223

Who Is This Course For?

The Data Structures course is designed for students that have previously completed a full-year computer science course, such as AP CSA. While C++ is used as the language for the course, the focus of the course is on understanding and applying advanced data structures.

Prior C++ knowledge is not a prerequisite, however students should have a working knowledge of basic computer science concepts such as variables, control structures, and functions/methods in at least one programming language.

Course Module Preview

This course format is slightly different than a traditional CodeHS course — there will be no instructional videos and the course will consist of fewer, more substantial exercises.

1. C++ Basics
2. Going Beyond The Basics
3. Libraries
4. 2D Vectors, Stacks, and Queues
5. Sets and Maps
6. Recursion
7. Pointers, Linked Lists, and Graphs
8. Final Project

Explore some of the concepts and programs that your students will work on throughout this course!