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 25 | Chp 1: Software Engineering Principles & Run Time Analysis, Big-O notation Lab 1 is assigned (due Sep 1) |
| Tue, Aug 30 | Chp 1: Big-O Notation [Classes] Check out this seminal paper: PRIMES are in P. Also see these papers A breakthrough, The Status of P vs NP |
| Thu Sep 1 | Chp 2: Big-O Notation & Computational Complexity [Inheritance & Composition] Lab2 (due Sep 8) |
| Tue Sep 6 | Chp 2: Big-O Notation & Computational Complexity [Operator Overloading and Templates] Practice with Big-O notation. Consider participating in ACM Programming Contest. Extra credit for participants. |
| Thu Sep 8 | Chp 3: Pointers |
| Tue Sep 13 | Chp 3: Array based lists, Virtual functions and abstract classes |
| Thu Sep 15 | Ch 4: Introduction to STL, vector and deque |
| Tue Sep 20 | Chp 4: Iterators, Algorithms, and practice |
| Thu Sep 22 | Chp 5: Intro to Linked Lists |
| Tue Sep 27 | Linked Lists continued |
| Thu Sep 29 | Linked Lists finished (douby linked lists, circular linked lists etc.) |
| Tue Oct 4 | Chp 6: Recursion |
| Thu Oct 6 | OCTOBER BREAK |
| Tue Oct 11 | Special Class meeting at Gund Gallery [Recursion continued] |
| Thu Oct 13 | Recursion continued (recursion and backtracking) |
| Tue Oct 18 | Midterm Exam |
| Thu Oct 20 | Chp 7 Stacks |
| Tue Oct 25 | Chp 7 finished |
| Thu Oct 27 | Chp 8: Queues |
| Tue Nov 1 | Chp 8 finished. (+ Intro to Linux) |
| Thu Nov 3 | Chp 9: Searhing and Hashing Algorithms |
| Tue Nov 8 | Chp 9 Finished |
| Thu Nov 10 | Ch 10: Sorting algorithms: Bubble sort, selection sort, insertion sort, shell sort |
| Tue Nov 15 | Ch 10: Merge Sort and Quick Sort. Animations of various sorting algorithms as falk dances. A slow sorting algorithm. |
| Thu Nov 17 | Ch 11: Binary Trees, Tree Traversals, Binary Search Trees (intro) |
THANKSGIVING BREAK |
|
| Tue Nov 29 | Ch11: Functions as Parameters, AVL Trees |
| Thu Dec 1 | Ch 11: AVL balancing, Heap Sort |
| Tue Dec 6 | Ch 12: Graphs |
| Thu Dec 8 | Chp 12: Graph Algorithms. You may find the animations on this site useful. Reminder: The Final Exam will be on Wed, Dec. 14 at 8:30 a.m.in the usual classroom. |