Data Structures in C++

Students will be able to:

• Print to the console
• Read in from the console
• Explain the difference between the getline and cin commands

Students will be able to explain different variable types in order to choose the best option for various programming situations.

Students will be able to use logical and comparison operators and apply them within the context of conditional statements (if/else statements).

Students will be able to use and construct for loops and while loops and explain when to use each type.

Students will be able to create functions and apply different C++ standards in order to streamline their programs.

Students will be able to:

• Prove their knowledge of C++ basic concepts through a multiple choice quiz

Students will be able to:

• Declare and initialize a vector
• Access and modify elements of a vector
• Iterate through a vector using a for and for-each loop
• Utilize vectors to solve real-world problems

Students will be able to:

• Write functions with default arguments
• Write prototypes with default arguments
• Write overloaded functions with default arguments
• Identify appropriate situations for defining default parameters

Students will be able to:

• Create user-defined structs
• Access and update struct member values
• Understand when and where structs can be used

Students will be able to:

• Read information in from a file
• Process information from a file
• Write information out to a file

Students will be able to:

• Write try/catch statements
• Catch standard C++ errors
• Throw and catch custom errors

Students will be able to:

• Prove their knowledge of C++ concepts through a multiple choice quiz

Students will be able to describe the purpose of a library and discuss the different parts of a header and implementation file as they are used in libraries.

Students will be able to understand how libraries make their code easier to develop and how to build and use the CodeHS Util library.

Students will be able to:

• Prove their knowledge of libraries through a multiple choice quiz

Students will be able to:

• declare and initialize a 2D vector
• access and modify elements of a 2D vector
• iterate through a 2D vector using a for and for-each loop
• utilize 2D vectors to solve real-world problems

Students will be able to:

• declare an empty stack
• add elements to a stack using the push() method
• remove elements from a stack using pop() method
• access the top value of a stack using the top() method
• perform other basic stack operations including size() and empty()

Students will be able to:

• declare an empty queue
• add elements to the back of a queue using the push() method
• remove elements from the front of a queue using the pop() method
• access values from the front and back of the queue using the front() and back() method, respectively.
• perform other basic stack operations including size() and empty()

Students will be able to:

• Prove their knowledge of 2D vectors, stacks, and queues through a multiple choice quiz

Students will be able to:

• Explain how pairs and iterators are used and how they differ from other tools in C++
• Create and use a pair in the proper setting
• Iterate through a vector using an iterator

Students will be able to:

• Explain how sets are different than other data structures they have encountered and where they can be used.
• Create, insert, update, and access members of a set
• Use an operator overload to use a struct with a set

Students will be able to:

• Explain how maps are different than other data structures they have encountered and where they can be used.
• Create, insert, update, and access members of a map

Students will be able to:

• Prove their knowledge of sets and maps through a multiple choice quiz

Students will be able to:

• Explain what recursion is and the different parts of a recursive function
• Write basic recursive functions
• Solve real-world problems using functional recursion.

Students will be able to:

• Explain the difference between procedural and functional recursion.
• Write basic recursive functions
• Understand the difference between a depth-first and a breadth-first search
• Solve real-world problems using functional recursion.

Students will be able to:

• Create a basic recursive backtracking algorithm
• Solve more complex recursive backtracking problems

Students will be able to:

• Prove their knowledge of recursion through a multiple choice quiz

Students will be able to:

• Declare a variable as a pointer using the dereference operator (*)
• Assign a pointer to an existing memory address using the reference operator (&) and a new memory address using the new keyword
• Declare and initialize pointers that point to data structures
• Declare and initialize data structures that store pointers
• Declare and call functions that take a pointer type as a parameter
• Use the arrow operator (->) to methods through a pointer in lieu of using the dot operator (.)

Students will be able to:

• Use object-oriented programming to implement the linked list data structure
• Insert new nodes into a linked list
• Traverse a linked list using a standard while loop
  traverse a linked list using recursion

Students will be able to:

• Explain what graphs are and what they are used for
• Make changes to existing graphs and customize the implementation

Students will be able to:

• Prove their knowledge of pointers, linked lists, and graphs through a multiple choice quiz