Monday | T | Wednesday | R | Friday |
---|---|---|---|---|
18
|
19
|
University Closed
20
Before Class:![]() ![]() Request personal CS account Class: |
21
|
University Closed
22
Before Class:![]() Submit Video Questions & Answers (for every video throughout the semester) Class: Due: |
BAS S305
25
Before Class:![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() Class: 1.4 C++ Classes (textbook pages 12-21) Due: |
26
|
27
Before Class:![]() ![]() ![]() ![]() ![]() Class: 1.4.3 Preprocessor Directives 1.5.1 Pointers Due: ![]() ![]() |
28
|
29
Before Class:![]() ![]() ![]() Class: 1.5.1 Pointers Due: |
Monday | T | Wednesday | R | Friday |
---|---|---|---|---|
Last Day to Drop Without a Grade
1
Before Class:![]() ![]() Class: 1.5.2 References Due: ![]() |
2
|
3
Before Class:![]() ![]() Class: Visual Studio: Debugging Due: ![]() |
4
|
5
Before Class:![]() ![]() ![]() ![]() ![]() ![]() ![]() Class: 1.5.3 Parameter Passing 1.5.4 Return Passing 1.5.5 std::swap and std::move 3.1 Abstract Data Types (ADTs) 3.2 List ADTs Due: ![]() |
8
Before Class:![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() Class: 1.5.6 The Big Five 1.5.7 C-style Strings |
9
|
University Closed
10
Before Class:![]() ![]() ![]() ![]() ![]() Class: 1.6.1 Function Templates 1.6.2, 1.6.5 Class Templates 1.6.3 Overloaded Operators 1.6.4 Function Objects 1.7 Matrices Due: Function Templates Exercises Class Templates Exercises Overloaded Operators Exercises |
11
|
12
Before Class:![]() ![]() ![]() ![]() ![]() Class: Inheritance Polymorphism Virtual Function Tables Abstract Base Classes Due: Visit Tutoring Lab (and sign the log) ![]() ![]() ![]() ![]() ![]() ![]() |
15
Class:3.3-3.7, 4.8, 6.9
STL slides 3.5 C++ Friends Due: ![]() |
16
|
17
Class:Polymorphism Virtual Function Tables Abstract Base Classes Exam 1 Game (Topics) Due: ![]() ![]() |
18
|
19
Before Class:![]() ![]() Class: 1.3 Recursion Due: |
22
Class:Exam1 (Topics) |
23
|
24
Before Class:![]() ![]() ![]() Class: 2.0 Algorithm Analysis Due: ![]() |
25
|
26
Before Class:![]() Class: 2.0 Algorithm Analysis Case Study: Sequential vs. Binary Search |
29
Before Class:![]() ![]() ![]() ![]() ![]() Class: 4.1 Trees (game) 4.2 Binary Trees Due: ![]() |
Monday | T | Wednesday | R | Friday |
---|---|---|---|---|
1
|
2
Before Class:![]() ![]() ![]() ![]() ![]() Class: 4.3 Binary Search Trees 4.3.6 Efficiency |
3
|
4
Before Class:![]() ![]() ![]() Class: 4.4 AVL Trees (handout) 4.5 Splay Trees (handout) |
|
Spring Break
7
|
8
|
Spring Break
9
|
10
|
Spring Break
11
|
14
Before Class:![]() ![]() Class: 4.5 Splay Trees (handout) 4.6 Tree Traversals (revisited) 4.7 B-Trees |
15
|
16
Class:Exam2 Game (Topics) Due: ![]() |
17
|
18
Class:Exam2 (Topics) |
21
Before Class:![]() ![]() ![]() ![]() ![]() Class: 5.1 Hashing 5.2 Hash Functions 5.3 Separate Chaining Due: |
22
|
23
Before Class:![]() ![]() ![]() ![]() Class: 5.4. Resolving Collisions 5.5 Rehashing Efficiency of Hashing |
24
|
Last day to withdraw without Department Chair's signature
25
Before Class:![]() ![]() ![]() Class: 6.1 Priority Queue 6.2-6.3.4 Heaps Due: ![]() |
28
Before Class:![]() ![]() ![]() ![]() ![]() Class: 6.3.4 BuildHeap 6.4 Applications of Priority Queues 6.9 Priority Queues in the STL |
29
|
30
Before Class:![]() ![]() ![]() ![]() ![]() ![]() Class: 7.1 Sorting Intro 7.2 Insertion Sort 7.3 Sorting Analysis I Due: ![]() |
31
|
Monday | T | Wednesday | R | Friday |
---|---|---|---|---|
1
Before Class:![]() ![]() ![]() ![]() ![]() ![]() Class: 7.5 Heapsort 7.6 Mergesort 7.7 Quicksort 7.8 Sorting Analysis II |
||||
4
Before Class:![]() ![]() ![]() Class: 7.5 Heapsort 7.6 Mergesort 7.7 Quicksort 7.8 Sorting Analysis II |
5
|
6
Before Class:![]() ![]() ![]() ![]() Class: 7.11 Linear-Time Sorts: Bucket Sort and Radix Sort 7.12 External Sorting |
7
|
8
Before Class:![]() ![]() Class: 9.1 Graphs (including Terminology) Due: ![]() |
11
Class:Exam3 Game (Topics) Due: |
12
|
13
Class:Exam3 (Topics) |
14
|
15
Before Class:![]() ![]() ![]() ![]() ![]() ![]() ![]() Class: 9.2 Topological Sorting 9.3 Shortest Paths (Dijkstra's Algorithm) 9.5 Minimum Spanning Trees (Prim's Algorithm) |
18
Before Class:![]() ![]() ![]() Class: 9.6 Applications of Depth-First Search (including Circuits) 9.7 Introduction to NP-Completeness |
19
|
20
Before Class:![]() ![]() ![]() ![]() ![]() ![]() Class: 10.1 Greedy Algorithms 10.2 Divide and Conquer Due: ![]() |
21
|
22
Before Class:![]() ![]() Class: 10.3 Dynamic Programming 10.4 Randomized Algorithms Due: |
25
Before Class:![]() Class: 10.5 Backtracking Algorithms |
26
|
27
Class:Final Game Review (Topics) Due: |
28
|
29
Class:Final: 10:00 AM - Noon (Topics) |
Monday | T | Wednesday | R | Friday |
---|---|---|---|---|
2
|
3
|
4
Due: |
5
|
6
|