| CMPS-2020 "Programming II: Data Structures and Algorithms" |
| Spring 2020 #33356 |
Binary trees from the exam final exam is graded --- your exam was emailed to you your overall grade is posted contact me with questions
| syllabus | textbook | scores | exams | grades | |||
| Week | Topic | Readings | Assignments |
| 1 |
Syllabus Review of 2010 course |
Gaddis 1 - 13 |
Lab-1 |
| 2 |
Classes, access, constructors Memberwise copy Cstrings vs string class Cstring pointers |
Gaddis 14, 15 |
Lab-2 |
| 3 |
Inheritance Base class Constructor, destructor Polymorphism Virtual member functions Base class pointers |
Gaddis chapter 15 |
Lab-3 |
| 4 |
Exceptions, try catch block Templates, functions and classes |
Gaddis chapter 16 |
Lab-4 |
| 5 |
Exam Arrays and searching Linear vs. binary |
Wengrow chap 1,2 |
Lab-5 |
| 6 |
Big-O notation Constant vs. linear time O(log n) Binary search Sorting Bubble, selection, insertion |
Wengrow chap 3,4,5,6 |
lab-6 |
| 7 |
Hash table Hashing, collisions |
Wengrow chap 7 |
lab-7 |
| 8 |
Stacks and queues |
Wengrow chap 8 |
lab-8 more points |
|
school went online
|
|||
| 9 |
Mar 16 Recursion Base case Stack frames |
Wengrow chap 9 Gaddis chap 19 |
quiz-1 quiz-2 Sample text file lab-9 |
| 10 |
Mar 23
No class Mon-Thurs
Friday class only |
Wengrow chap 10 |
|
| 11 |
Mar 30 Merge sort Quick sort |
Wengrow chap 10 |
lab-11 |
| 12 |
Apr 6
Exam
Node-based data structuresSelf-referential data Linked lists |
Wengrow chap 11 Gaddis chap 17 |
lab-12 |
|
Spring break week. Monday Apr 13 to Friday Apr 17
|
|||
| 13 |
Apr 20 Binary trees BST - binary search tree |
Wengrow chap 12 Gaddis chap 20 |
|
| 14 |
Apr 27 more binary trees |
more questions | |
| 15 |
May 4 Quicksort Heapsort (maybe) |
Wengrow chap 13 |
qsort.cpp program homework-13 final exam warmup |
| Final Exam: Friday May 15 at 8:00am - 10:30am | |||
