Data Structures in C++

In this lesson, students learn basic input and output in C++ and will make a Haiku. Students will be exposed to the concept of variables, but more detail will follow in the next lesson.

In this lesson, students will learn the different variable types available in C++ and will learn the syntax for declaring and initiating these variables.

In this lesson, students will learn different C++ syntax used to compare two variables, use logical operators such as and, or, and not, and apply these to conditional statements.

In this lesson, students will learn to construct and apply for loops and while loops in C++. They will then apply these concepts to real-world problems.

In this lesson, students will learn to create functions in C++ as well as study some of the intricacies of C++ functions such as pass-by-reference and function prototypes.

In this lesson, students learn about vectors, a data structure that stores elements of a given type in a linear arrangement. Similar to lists in Python or ArrayLists in Java, vectors are dynamically resizable, allowing elements to be inserted, removed, and updated without the need of allocating additional memory for its elements.

In this lesson, students learn how to provide default values for function parameters. Default parameters are used if a function is called without passing arguments. If an argument is provided, the default value is ignored.

In this lesson, students will be introduced to the idea of a struct. A struct is a basic C++ element that is used to store multiple data elements (members) in a single variable. Students will explore how to create and access structs in this lesson.

In this lesson, students will learn how to read and write data from a file in order to open up more options to process larger volumes of data.

In this lesson, students will learn how to write try/catch statements to handle built-in errors as well as catch custom errors in order to have programs run efficiently and enhance user experiences.

In this lesson, students learn about two-dimensional (2D) vectors, a data structure that stores elements in a grid-like arrangement of ?rows? and ?columns.? Every element of a 2D vector is a vector, similar to how every element of a 2D array is an array.

In this lesson, students learn about stacks, a linear data structure that follows the LIFO (Last In First Out) principle. Similar to the behavior of real-world stacks, such as a stack of plates or deck of cards, elements of a stack are both inserted and removed from the top of the stack.

In this lesson, students learn about queues, a linear data structure that follows the FIFO (First In First Out) principle. Similar to the behavior of real-world queues, such as a waiting queue or printing queue, elements of a queue are both inserted at the back of the queue and removed from the front of the queue.

In this lesson, students learn about pointers, a variable that holds a memory address. Pointers are one of the key concepts in learning programming and are used for implementing several data structures.

In this lesson, students learn about linked lists, a linear data structure in which elements are not stored next to each other in memory. Linked lists consist of nodes that each contain a data element and a pointer to the next node in the linked list.