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 30 | Introduction, Logistics, A quick review, Chp 1: Software Engineering Principles Lab 1 is assigned (due Sep 10) |
| Tue, Sep 4 | Chp 1: Run Time Analysis, and Big-O notation |
| Thu, Sep 6 | 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 11 | Chp 2: Inheritance and Templates. Run Time Analysis. Lab2 (due Sep 17) |
| Thu Sep 13 | Practice with Big-O notation. |
| Tue Sep 18 | Chp 3: Pointers. Handout on pointers. Lab 3 (due Sep 24) |
| Thu Sep 20 | Chp 3: Array based lists, Virtual functions and abstract classes |
| Tue Sep 25 | Ch 4: Introduction to STL, vector and deque Lab 4 (due Oct 1) |
| Thu Sep 27 | Chp 4: Iterators, Algorithms, and practice |
| Tue Oct 2 | Chp 5: Intro to Linked Lists Lab 5 (due Oct 15) |
| Thu Oct 4 | Linked Lists continued. |
| Tue Oct 9 | Linked Lists finished (douby linked lists, circular linked lists etc.). Intro Linux? |
| Thu Oct 11 | OCTOBER BREAK |
| Tue Oct 16 | Chp 6: Recursion. Some video lessons on recursion from Scmp 118. Part1, Part2 Lab 6, (due Oct 24) |
| Thu Oct 18 | Recursion continued (recursion and backtracking) |
| Tue Oct 23 | Midterm Exam |
| Thu Oct 25 | Chp 7 Stacks Lab 7 (due Oct 31) |
| Tue Oct 30 | Chp 7 finished |
| Thu Nov 1 | Chp 8: Queues Lab 8 (due Nov 7) |
| Tue Nov 6 | Chp 8 finished. (+ Intro to Linux) |
| Thu Nov 8 | Chp 9: Searhing and Hashing Algorithms Lab 9 (Nov 14) |
| Tue Nov 13 | Chp 9 Finished |
| Thu Nov 15 | Ch 10: Sorting algorithms: Selection Sort, Insertion Sort, Bubble Sort, and Merge Sort Lab 10 (due Nov 28) |
THANKSGIVING BREAK |
|
| Tue Nov 27 | Ch 10: Shell Sort and Quick Sort. Animations of various sorting algorithms as falk dances. A slow sorting algorithm. |
| Thu Nov 29 | Ch 11: Binary Trees, Tree Traversals, Binary Search Trees (intro) Lab 11 (due Dec 5) |
| Tue Dec 4 | Ch11: Functions as Parameters, AVL Trees, Balancing AVL Trees |
| Thu Dec 6 | Ch 11: Heap Sort Lab 12 (due Dec 12) |
| Tue Dec 11 | Ch 12: Graphs |
| Thu Dec 13 | Chp 12: Graph Algorithms. You may find the animations on this site useful. Reminder: The Final Exam will be on Tue, Dec. 18 at 1:30 p.m.in the usual classroom. |