Give students the skills they need to write complex programs using an object-oriented approach and utilizing appropriate data structures. Provide valuable programming experience in appropriate laboratory assignments, homework and projects. Ensure a fair and accurate measurement of student performance by using a variety of scores.
Students are expected to have read the assigned chapters before the indicated class sessions. Readings from Deitel and Deitel are prefixed with DD and readings from Main and Savitch are prefixed with MS.
Week Monday/Tuesday Wednesday/Thursday
1 Jan 10/11: Introduction; MS 1 Jan 12/13: Introduction (cont.) DD 1, 2.22
2 Jan 17/18: Abstract Data Types: MS 2.1-2.3 Jan 19/20: Classes and Data Abstraction: DD 6.1-6.9
3 Jan 24/25: ADTs (cont.): MS 2.4-2.5 Jan 26/27: Classes (cont.): DD 6.10-6.18
4 Jan 31/Feb 1: Container Classes: MS 3 Feb 2/3: Classes Part II: DD 7.1-7.5
5 Feb 7/8: Classes Part II (cont): DD 7.6-7.11 Feb 9/10: Pointers and Dynamic Arrays: MS 4.1-4.2
Programming project 1 due
6 Feb 14/15: Operator Overloading: DD 8 Feb 16/17: Pointers and Dynamic Arrays (cont.): MS 4.3-4.4
7 Feb 21/22: Linked Lists: MS 5.1-5.2 Feb 23/24: Linked Lists (cont.): MS 5.3-5.5
8 Feb 28/29: Templates: MS 6.1-6.2 Mar 1/2: Templates (cont.): MS 6.3-6.5
Programming project 2 due
9 Mar 6/7: Review Mar 8/9: Mid-term Exam
10 Mar 13-18: Spring recess
11 Mar 20/21: Stacks: MS 7.1-7.2 Mar 22/23: Stacks (cont.): MS 7.3-7.4
12 Mar 27/28: Queues: MS 8.1-8.2 Mar 29/30: Queues (cont.): MS 8.3-8.4
13 Apr 3/4: Recursive Thinking: MS 9.1-9.2 Apr 5/6: Recursive Thinking (cont.): MS 9.3
Programming project 3 due
14 Apr 10/11: Trees: MS 10.1-10.3 Apr 12/13: Data Structures: DD 15
15 Apr 17/18: Trees (cont.): MS 10.4-10.5 Apr 19/20: Searching: MS 12.1
Programming project 4 due
16 Apr 24/25: Sorting: MS 13.1-13.2 Apr 26/27: Review
17 May 3: Final examination, Wednesday, 2:00 PM to 4:00 PM or
18 May 9: Final examination, Tuesday, 2:00 PM to 4:00 PM.