Course Calendar for Scmp 218
It is expected that you read all the sections to be covered BEFORE the class and come to class prepared to discuss
the topics.
Check this page regularly for updates . This is a tentative schedule to be updated as needed.
| Date | Section/Topic/Reading Assignment |
| Thu, Aug 29 | Introduction, Logistics, A quick review, Chp 1: Software Engineering Principles Lab 1 is assigned (due Sep 9) |
| Tue, Sep 3 | Chp 1: Run Time Analysis, and Big-O notation |
| Thu, Sep 5 | Big-O Notation & Computational Complexity. Chp 2: Operator Overloading. Check out this seminal paper: PRIMES are in P. Also see these papers A breakthrough, The Status of P vs NP |
| Tue Sep 10 | Chp 2: Inheritance and Templates. Run Time Analysis. Lab2 (due Sep 16) |
| Thu Sep 12 | Practice with Big-O notation. |
| Tue Sep 17 | Chp 3: Pointers. Handout on pointers. Lab 3 (due Sep 23) |
| Thu Sep 19 | Chp 3: Array based lists, Virtual functions and abstract classes |
| Tue Sep 24 | Ch 4: Introduction to STL, vector and deque Lab 4 (due Sep 30) |
| Thu Sep 26 | Chp 4: Iterators, Algorithms, and practice |
| Tue Oct 1 | Chp 5: Intro to Linked Lists Lab 5 (due Oct 14) |
| Thu Oct 3 | Linked Lists continued. |
| Tue Oct 8 | Linked Lists finished (douby linked lists, circular linked lists etc.). Intro Linux? |
| Thu Oct 10 | OCTOBER BREAK |
| Tue Oct 15 | Chp 6: Recursion. Some video lessons on recursion from Scmp 118. Part1, Part2 Lab 6, (due Oct 23) |
| Thu Oct 17 | Recursion continued (recursion and backtracking) |
| Tue Oct 22 | Midterm Exam |
| Thu Oct 24 | Chp 7 Stacks Lab 7 (due Oct 30) |
| Tue Oct 29 | Chp 7 finished |
| Thu Oct 31 | Chp 8: Queues Lab 8 ( due Nov 6) |
| Tue Nov 5 | Chp 8 finished. (+ Intro to Linux) |
| Thu Nov 7 | Chp 9: Searhing and Hashing Algorithms Lab 9 (due Nov 13) |
| Tue Nov 12 | Chp 9 Finished |
| Thu Nov 14 | Ch 10: Sorting algorithms: Selection Sort, Insertion Sort, Bubble Sort, and Merge Sort Lab 10 (due Nov 20) |
| Tue Nov 19 | Ch 10: Shell Sort and Quick Sort. Animations of various sorting algorithms as falk dances. MergeSort vs QuickSort. ShellSort. A slow sorting algorithm. |
| Thu Nov 21 | Ch 11: Binary Trees, Tree Traversals, Binary Search Trees (intro) Lab 11 (due Dec 4) |
THANKSGIVING BREAK |
|
| Tue Dec 3 | Ch11: Functions as Parameters, AVL Trees, Balancing AVL Trees |
| Thu Dec 5 | Ch 11: Heap Sort Lab 12 (due Dec 11) |
| Tue Dec 10 | Ch 12: Graphs |
| Thu Dec 12 | Chp 12: Graph Algorithms. You may find the animations on this site useful. Reminder: The Final Exam will be on Thu, Dec 16 at 6:30 pm in the usual classroom |