Spring 2017 Course Schedule

Spring 2017 Course Schedule - 16-Week Semester

The purpose of this schedule is to help you pace yourself during the semester. I will be adding due dates for the remaining programs during the semester. Be sure to review my Late Policy for programming assignments and exams in the course syllabus. Absolute deadlines are also listed in this schedule.

I reserve the right to correct any errors in this schedule. Any changes will be noted on the course home page.

Week of	Reading Assignments/Activities
1/16 1	* MLK Jr. Holiday - ACC closed Monday 1/16 * Start working on Program 1 (covers material you should already know). Chapter 1 – Data Abstraction C++ Interlude 1 – C++ Classes
1/23 2	Chapter 2 - Recursion (sections 2.5, 2.6.2, 2.6.3 are optional) Complete Program 1 - Due 1/29
1/30 3	Chapter 3 – Array-Based Implementations You can start Program 2 after you have completed the readings to this point. C++ Interlude 2 - Pointers, Polymorphism and Memory Allocation Complete Program 2 - Due 2/5
2/6 4	Chapter 4 – Linked-Based Implementations Chapter 5 - Recursion as a Problem-Solving Technique (sections 5.1 - 5.3)
2/13 5	Chapter 6 – Stacks C++ Interlude 3 – Assertions Chapter 7 – Implementation of the ADT Stack Complete Program 3 - Due 2/19
2/20 6	Chapter 8 – Lists Chapter 9 – List Implementations Complete Program 4 - Due 2/26
2/27 7	Chapter 10 – Algorithm Efficiency Chapter 11 – Sorting Complete Exam 1 - Due 3/5
3/6 8	Chapter 11 - Sorting (continued)
3/13	* Spring break - ACC closed Monday 3/13 through Sunday 3/19 *
3/20 9	C++ Interlude 4 – Safe Memory Management (smart pointers) C++ Interlude 5 - Class Relationships and Reuse Chapter 12 – Sorted Lists and Their Implementation Complete Program 5 Postfix Calculator - Due 3/26
3/27 10	Chapter 13 – Queues and Priority Queues Chapter 14 – Queues and Priority Queue Implementations C++ Interlude 6 – Overloaded Operators and Friend Access Complete Program 6 List ADT - Try to complete by 4/2. It is okay if it takes you a few extra days.
4/3 11	Chapter 15 – Trees
4/10 12	Chapter 16 – Tree Implementations Complete Program 7 QuickSort - Due 4/16. Try to complete early. Complete Exam 2 - Due 4/16. It is okay if it takes you a few extra days.
4/17 13	Chapter 16 – Tree Implementations (continued)
4/24 14	Last day to withdraw is Monday, April 24. Chapter 17 – Heaps Complete Program 8 Binary Search Tree - Due 4/30. All programs except the last two will not be accepted after 11:59 pm on Sunday, Sunday, April 30. Exams 1 & 2 will not be accepted after Sunday, April 30.
5/1 15	Chapter 18 – Dictionaries and Their Implementations, and Hashing
5/8 16	Complete Exam 3. See below for test deadlines - no grace period! The last two programs must be submitted by 11:59 pm on Friday, May 12. Exam 3 will be available at all Testing Centers through Wednesday, May 10.

Return to Data Structures Home Page