Date
| Lecture
| Topics
|
Wed, Jan 14
| 1
| Introduction
|
Review of C++
|
Assign Project 1
|
Thu, Jan 15
| 2
| Pointers
|
Fri, Jan 16
| Lab 1
|
Mon, Jan 19
| 3
| Pointer Arithmetic
Pointers and Arrays
Pointers as Function Parameters
|
Wed, Jan 21
| 4
| Structs
|
Thu, Jan 22
| Lab 2
|
Fri, Jan 23
| 5
| Classes
|
Mon, Jan 26
| 6
| Vectors
Dynamic Allocation of Memory in C
Dynamic Allocation of Memory in C++
|
Wed, Jan 28
| Lab 3
|
Thu, Jan 29
| 7
| Memory Leaks Dangling Pointers
|
Fri, Jan 30
| 8
| The Default Constructor
The Copy Constructor
|
Mon, Feb 2
| Lab 4
|
Wed, Feb 4
| 9
| The Destructor
The this Pointer
The Assignment Operator
|
Thu, Feb 5
| 10
| Template Functions
|
Fri, Feb 6
| Lab 5
|
Mon, Feb 9
| 11
| Template Classes
Assign Project 2
|
Wed, Feb 11
| 12
| Operators
Operators as Member Functions
Operators with Facilitators
|
Thu, Feb 12
| Lab 6
|
Fri, Feb 13
| Test 1
|
Mon, Feb 16
| 13
| Bitwise Operators
|
Wed, Feb 18
| 14
| Operators as Friends
Unary Operators
|
Thu, Feb 19
| 15
|
Conversion Operators
Function Return Values
Assign Project 3
|
Fri, Feb 20
| Lab 7
|
Mon, Feb 23
| 16
|
Time Complexity
|
Wed, Feb 25
| 17
|
Lists
List Constructors
List Destructor
List Inspectors
List Mutators
List Facilitators
List Operators
Other List Functions
|
Thu, Feb 26
| 18
|
Array Lists
|
Fri, Feb 27
| 19
|
Linked Lists
Linked List Nodes
|
Mon, Mar 1
| Lab 8
|
Wed, Mar 3
| 20
|
Chasing Pointers
The Method
Assign Project 4
|
Thu, Mar 4
| 21
|
The Method
Linked Lists with Tails
Doubly Linked Lists
|
Fri, Mar 5
| 22
|
Doubly Linked Lists
|
Spring Break
|
Mon, Mar 15
| 23
|
Circularly Linked Lists
Evaluation of List Implementations
|
Wed, Mar 17
| 24
|
Inheritance
|
Thu, Mar 18
| Lab 9
|
Fri, Mar 19
| Test 2
|
Mon, Mar 22
| 25
|
Inherited Constructors
Access to Inherited Members
Polymorphism
|
Wed, Mar 24
| Lab 10
|
Thu, Mar 25
| 26
| Virtual Functions
Abstract Classes
Assign Project 5
|
Fri, Mar 26
| 27
| Stacks
Stack Interface
Stack Applications - Postfix Expressions
Stack Applications - Solving a Maze
Stack Applications - Function Calls
|
Mon, Mar 29
| 28
| Queues
Queue Interface
Queue Implementation
|
Wed, Mar 31
| 29
| Queue Applications - Infix Expressions
Queue Applications - Waiting Lines
|
Thu, Apr 1
| 30
| List Iterators
List Iterator Interface
|
Fri, Apr 2
| Lab 11
|
Mon, Apr 5
| 31
| List Traversals
Static Members
Assign Project 6
|
Wed, Apr 7
| 32
| Recursion
|
Thu, Apr 8
| Lab 12
|
Fri, Apr 9
| 33
| Recursive Linked Lists
Evaluation of Lists
|
Mon, Apr 12
| 34
| Binary Trees
Implementations of Binary Trees
Binary Tree Nodes
|
Wed, Apr 14
| 35
| The Binary Tree Interface
|
Thu, Apr 15
| Lab 13
|
Fri, Apr 16
| Test 3
|
Mon, Apr 19
| 36
| Binary Tree Traversals
Binary Tree Iterators
Assign Project 7
|
Wed, Apr 21
| 37
| Binary Search Trees
|
Thu, Apr 22
| 38
| The Shell Sort
The Merge Sort
|
Fri, Apr 23
| Lab 14
|
Mon, Apr 26
| 39
| The Quick Sort
The qsort() Library Function
Review
|