Programming and Data Structures

0.3

Foundations

Introduction
C++ Fundamentals
Types
- Arithmetic and Comparisons
- Library Types
Control Structures
Procedural Abstraction
Testing
Machine Model I
- Pointers
  - Pointers and References
Machine Model II
- Pointer Errors
- Function Calls and the Call Stack
  - Function-Call Process

Data Abstraction

The const Keyword
Structs
- Compound Objects and const
Abstract Data Types in C
Command-Line Arguments
Input and Output (I/O)
More on Streams
- String Streams
Program Design
Abstract Data Types in C++
Derived Classes and Inheritance
- Ordering of Constructors and Destructors
- Name Lookup and Hiding
Polymorphism

Containers and Dynamic Memory

Containers and Iterators
- Range-Based For Loops
  - Iterating over a Map
Time Complexity
Arrays
Array-based Containers
Container ADTs and Polymorphism
Memory Models and Dynamic Memory
Managing Dynamic Memory
- RAII
- Growable Set
The Big Three
Linked Lists
Implementing Iterators

Functional Programming

Function Objects
Impostor Syndrome
Recursion
Structural Recursion
- Recursive Lists
- Trees
  - Tree Traversals
Binary Search Trees (BSTs)
- The BinarySearchTree Interface
- BST-Based Set
Maps and Pairs

Odds and Ends

Error Handling and Exceptions

Supplemental Material

Introduction to C++
Solving Problems with Recursion
Containers of Pointers
- Sorting Containers of Pointers
- Containers of Polymorphic Objects
C and C++ Strings
- C-Style Strings
  - String Traversal and Functions
  - Printing C-Style Arrays
- C++ Strings

Programming and Data Structures

Program Design

Previous Next

Program Design

Apologies – this section has not been written yet.

Previous Next

© Copyright 2019, Amir Kamil, licensed under the Creative Commons Attribution-ShareAlike 4.0 International license.

Built with Sphinx using a theme provided by Read the Docs.