Date | Lecture | Section | Topics | Due Date | |
---|---|---|---|---|---|
Mon, Jan 15 | 1 | Secs. 13.1 - 13.14 | Classes Project 1 - Knight's Tour TourBoard Class |
Fri Jan 26 | |
Wed, Jan 17 | 2 | Secs. 20.1 - 20.4 | Recursion | ||
Thu, Jan 18 | Lab 1 - Recursion | Tue Jan 23 | |||
Fri, Jan 19 | 3 | Secs. 9.1 - 9.3 | Pointers | ||
Mon, Jan 22 | 4 | Secs. 9.4 - 9.7 | Pointer Arithmetic | ||
Wed, Jan 24 | 5 | Sec. 9.8 | Dynamic Allocation of Memory | ||
Thu, Jan 25 | Lab 2 - Pointers | Tue Jan 31 | |||
Fri, Jan 26 | 6 | Secs. 10.11 - 10.13 | Constructors | ||
Mon, Jan 29 | 7 | Sec. 13.7 - 13.8 | Assignment Operator | ||
Wed, Jan 31 | 8 | Sec. 13.9, 14.5 | Type Conversions | ||
Thu, Feb 1 | Lab 3 - Allocation of Memory | Tue Feb 7 | |||
Fri, Feb 2 | 9 | Sec. 16.2 | Template Functions | ||
Mon, Feb 5 | 10 | Sec. 16.3 | Template Classes | ||
Wed, Feb 7 | Project 2
PuzzleBoard Class Move Class | Fri Feb 16 | |||
Thu, Feb 8 | Lab 4 - The Fundamental Member Functions | Tue Feb 13 | |||
Fri, Feb 9 | 12 | Sec. 14.5 | Operators | ||
Mon, Feb 12 | 13 | Sec. 14.5 | Unary Operators | ||
Wed, Feb 14 | 14 | Lists | |||
Thu, Feb 15 | Lab 5 - Templates | Tue Feb 20 | |||
Fri, Feb 16 | 15 | Array Lists | |||
Mon, Feb 19 | 16 | Sec. 18.1 - 18.3 | Linked Lists | ||
Wed, Feb 21 | 17 | Sec. 18.1 - 18.3 | Implementing Linked Lists | ||
Thu, Feb 22 | Lab 6 - Operators | Tue Feb 28 | |||
Fri, Feb 23 | Test 1 | ||||
Mon, Feb 26 | 18 | Sec. 18.1 - 18.3 | Linked Lists with Tail | ||
Wed, Feb 28 | 19 | Sec. 18.5 | Doubly Linked Lists | ||
Thu, Mar 1 | Lab 7 - Linked Lists | Tue, Mar 13 | |||
Fri, Mar 2 | 20 | Sec. 18.5 | Circularly Linked Lists | ||
Mon, Mar 5 | Spring Break | ||||
Wed, Mar 7 | |||||
Thu, Mar 8 | |||||
Fri, Mar 9 | |||||
Mon, Mar 12 | Project 3A - Hashtables State Class HashtableEntry Class Hashtable Class |
||||
Wed, Mar 14 | 22 | Sec. 9.6 | Time Complexity | ||
Thu, Mar 15 | Lab 8 - Time Complexity | Tue Mar 20 | |||
Fri, Mar 16 | 23 | Secs. 18.1 - 18.2 | Stacks and their Applications | ||
Mon, Mar 19 | 24 | Project 3B - Hashtables Menu Class Stacks and their Applications |
|||
Wed, Mar 21 | 25 | Secs. 19.4 - 19.6 | Queues and their Applications | ||
Thu, Mar 22 | Lab 9 - Stacks and Queues | Tue Mar 27 | |||
Fri, Mar 23 | 26 | Secs. 19.4 - 19.6 | Queues and their Applications | ||
Mon, Mar 26 | 27 | Sec. 15.1 | Introduction to Inheritance | ||
Wed, Mar 28 | 28 | Secs. 15.2 - 15.5 | Inheritance - The Fundamental Functions | ||
Thu, Mar 29 | Lab 10 - Inheritance - The Fundamental Functions | Tue Apr 3 | |||
Fri, Mar 30 | 29 | Secs. 15.6 - 15.7 | Inheritance - Polymorphism | ||
Mon, Apr 2 | Project 4 - Infix Evaluator Token Class Number Class Operator Class LParen Class RParen Class |
||||
Wed, Apr 4 | 30 | Sec. 19.1 | List Iterators | ||
Thu, Apr 5 | Lab 11 - Inheritance - Polymorphism | ||||
Fri, Apr 6 | 31 | Sec. 19.2 | List Iterator Implementation | ||
Mon, Apr 9 | 32 | Secs. 20.4 - 20.5 | Recursive Linked Lists | ||
Wed, Apr 11 | Test 2 | ||||
Thu, Apr 12 | Lab 12 - Iterators | ||||
Fri, Apr 13 | 33 | Sec. 19.2 | Binary Trees | ||
Mon, Apr 16 | 34 | Sec. 16.5 | Binary Tree Implementation | ||
Wed, Apr 18 | 35 | Sec. 16.5 | Binary Tree Traversals | ||
Thu, Apr 19 | Lab 13 - Binary Trees | ||||
Fri, Apr 20 | 36 | Secs. 9.7 - 9.8 | Binary Search Trees | ||
Mon, Apr 23 | 31 | Secs. 9.7 - 9.8 | The STL Classes | ||
Wed, Apr 25 | 32 | Secs. 16.5, 17.6, 18.3, 18.6 | The STL Examples | ||
Thu, Apr 26 | Lab 14 - The Standard Template Library | ||||
Fri, Apr 27 | 39 | The STL Algorithms | |||
Mon, Apr 30 | Final Exam (1:30 pm - 4:30 pm) |