Comprehensive Software Development Using C++

Course Curriculum

Chapter 1: Introduction and Setup (Beginners shouldn't skip this section)

Lecture 1: Introduction and Course Overview

Lecture 2: Introduction to Computer Science

Lecture 3: Bits and Bytes: Fundamental computer number systems

Lecture 4: Setting up a compiler for C++

Lecture 5: Choosing an Editor (Lengthy Optional Video)

Lecture 6: Using a lightweight IDE to write our first program

Lecture 7: Using VIM to write our first program (Optional Video)

Lecture 8: Using CLION IDE to write our first program (Optional video)

Chapter 2: In-Depth Programming Concepts using C++

Lecture 1: Hello World Deep Dive Part 1

Lecture 2: Hello World Deep Dive Part 2

Lecture 3: Variables and Data Types Part 1

Lecture 4: Variables and Data Types Part 2

Lecture 5: Logic Part 1

Lecture 6: Logic Part 2

Lecture 7: Conditional Statements Part 1

Lecture 8: Conditional Statements Part 2

Lecture 9: Conditional Statements Part 3

Lecture 10: Arithmetic Operators Part 1

Lecture 11: Arithmetic Operators Part 2

Lecture 12: Memory and Containers Introduction

Lecture 13: Arrays

Lecture 14: Strings Part 1

Lecture 15: Strings Part 2

Lecture 16: Input Part 1

Lecture 17: Input Part 2

Lecture 18: Input Part 3

Lecture 19: Input Part 4

Lecture 20: Practice Problems 1

Lecture 21: While Loops Part 1

Lecture 22: While Loops Part 2

Lecture 23: While Loops Challenge (Part 3)

Lecture 24: For Loops Part 1

Lecture 25: For Loop Practice (Part 2)

Lecture 26: Functions Part 1

Lecture 27: Functions Part 2

Lecture 28: Functions Challenge (Part 3)

Lecture 29: Functions Part 4

Lecture 30: Functions Part 5

Lecture 31: A Deeper Look at Virtual Memory

Lecture 32: Pointers and Dynamic Memory 1

Lecture 33: Pointers and Dynamic Memory 2

Lecture 34: Pointers and Dynamic Memory 3

Lecture 35: Dynamically Allocated Arrays

Lecture 36: Nested Loops

Lecture 37: 2 Dimensional Arrays (Matrices)

Lecture 38: Dynamic 2d Arrays

Lecture 39: Formatting Console Output

Lecture 40: PROJECT 1

Lecture 41: File Streams

Lecture 42: Command Line Arguments

Lecture 43: Exceptions

Lecture 44: Vectors 1

Lecture 45: Vectors 2

Lecture 46: Programming Challenge (Sorting)

Lecture 47: BubbleSort

Lecture 48: A Better BubbleSort

Lecture 49: InsertionSort

Lecture 50: Programming Challenge (Searching)

Lecture 51: Sequential Search

Lecture 52: Binary Search

Lecture 53: Graphical Debuggers (CLion)

Lecture 54: Command Line Debuggers (GDB)

Lecture 55: Introduction to Abstract Data Types

Lecture 56: Structs 1

Lecture 57: Structs 2

Lecture 58: Object Oriented Programming 1

Lecture 59: Object Oriented Programming 2

Lecture 60: Object Oriented Programming 3

Lecture 61: Object Oriented Programming 4

Lecture 62: Destructors and Dynamically Allocated Objects

Lecture 63: Copy Constructors and Smart Pointers

Lecture 64: A Bit More on Smart Pointers

Lecture 65: Overloaded Operators (Intro and Assignment Operator)

Lecture 66: Overloaded Operators (Addition and Subtraction)

Lecture 67: Overloaded Operators (Equality)

Lecture 68: Overloaded Operators (Input and Output)

Lecture 69: Inheritance (Introduction and UML)

Lecture 70: Inheritance (Part 2)

Lecture 71: Polymorphism (Part 1)

Lecture 72: Polymorphism (Part 2)

Lecture 73: Function Templates (Part 1)

Lecture 74: Function Templates (Part 2)

Lecture 75: Class Templates

Chapter 3: Data Structures and Algorithms

Lecture 1: Big O Notation

Lecture 2: Linked Lists 1

Lecture 3: Linked Lists 2

Lecture 4: Linked Lists 3

Lecture 5: Linked Lists 4 (Intro to Doubly Linked Lists)

Lecture 6: Linked List Challenge 1 Solution

Lecture 7: Making a better Append Function and Adding an Insertion Function (Linked Lists)

Lecture 8: Linked List Challenge 2 Solution