| INSTRUCTOR: | Rex Forsyth, |
|
|
Office: D516 |
| TIME OF LECTURES: | TTh | 9:00 a.m. - 11:50 a.m. | ROOM: C620 | |
| ACADEMIC ASSISTANT: | Rex Forsyth, |
|
|
Office: D516 |
| TUTORIAL 1 : | WF | 10:00 a.m. - 10:50 a.m. | ROOM: E519 | |
| LAB 1 : | WF | 11:00 a.m. - 11:50 a.m. | ROOM: D519 |
NOTE: Tutorials and Labs begin on May 12th
| TEXTBOOK : | C++ From the Beginning, Second Edition | Jan Skansholm |
| METHOD OF EVALUATION: | Assignments(8) | 24% |
| Final Project | 6% | |
| Midterm Exam (June 3) | 30% | |
| Final Exam (June 24) | 40% |
TOPICS:
We will cover the following sections and chapters from the text:
Sec 2.8, 3.2, 3.3, 4.5, 4.8; Chap 5-15 and Appendix C
plus some
additional material on algorithm analysis and searching and sorting.
| Date | Chapter | Topic | |
| MAY | 11 | 3.2, 3.3, 4.5, 4.7, 11 | CS1620 Review; CS2620 Preview; Functions; Libraries; Strings; Streams. |
| 13 | 5 | Types; Memory; Pointers & Dynamic Memory Allocation. | |
| 18 | 2.8, 5, 6 | Dynamic Arrays; Vectors; Object Oriented Programming. | |
| 20 | 7, 8 | Class construction; Operator Overloading; | |
| 25 | Chap 9 | Composition & Inheritance. | |
| 27 | 9 | Polymorphism. | |
| JUNE | 1 | 13, 14 | Linked Structures - Lists (Single, Double, Circular). |
| 3 | 14 & Midterm | Stacks & Queues. Midterm will take 2 hrs. | |
| 8 | 4.8, 14 | Recursion; Binary Search Trees. | |
| 10 | Notes | Algorithm Analysis; Searching &Sorting; | |
| 15 | 10, 15 | Exception Handling & Namespaces; | |
| 17 | 12 | Container Classes and Algorithms | |
| 22 | Appendix C | Standard Template Library; Review. | |
| 24 | Final Exam | (3 hours) |
COMMENTS:
All assignments are due at 11:00 PM of the specified due date.
| Assign- | Handout | Lab | Due | |||
| ment # | Chapter | Topic | Weight | Date | Dates | Date |
| 1 | 4.5, 3.2, 3.3, 11 | Libraries, Strings & Streams | 3% | May 11 | 12 | 14 |
| 2 | 5 | Pointers | 3% | 13 | 14 | 17 |
| 3 | 2.8, 5 | Dynamic Arrays; Vectors. | 3% | 18 | 19 | 21 |
| 4 | 6, 7, 8 & 6 | Classes and Operator Overloading. | 3% | 20 | 21 | 26 |
| 5 | 9 | Inheritance, Polymorphism | 3% | 25 | 26,28 | 31 |
| 6 | 13 & 14 | Linked Structures | 3% | June 1 | 2,4 | 7 |
| 7 | 4.8 & 14 | Recursion & Binary Search Trees | 3% | 8 | 9 | 11 |
| 8 | Notes | Algorithm Analysis; Searching & Sorting | 3% | 10 | 11 | 14 |
| Project | All | Everything | 6% | 15 | 16,18,22 | 23 |