Week 1 |
|
| 03 March to 07 March, 2008 | Other weeks: - 1 2 3 4 5 6 7 8 9 10 11 12 |
| Study Material | Tasks | Content |
|
Read Textbook: Chapter 9: Pointers (pp. 495-535) Study the Week 1 Lecture Slides |
Read the Course Profile Join the COIT23001-t1 mailing list Ensure you can create, debug and run a multi-file project Complete Week 1's Tutorial Exercises |
* The notation of pointers * The relationship between arrays and pointers * Pointer arithmetic Initialising pointers * Comparing pointers Pointers as function parameters * The new and delete operators * Dynamic memory allocation |
Week 2 |
|
| 10 March to 14 March, 2008 | Other weeks: - 1 2 3 4 5 6 7 8 9 10 11 12 |
| Study Material | Tasks | Content |
|
Read Textbook: Chapter 13: Introduction to Classes (pp. 711-793) Study the Week 2 Lecture Slides |
Ensure you can create, debug and run a multi-file project Complete Week 2's Tutorial Exercises |
* Procedural and object-oriented programming * Object modelling * Classes, objects, encapsulation and implementation hiding * Private and public members * Inline member functions * Constructors * Passing arguments to constructors * Destructors * Overloading constructors * Private member functions * The unified modelling language (UML) * Object-Oriented Design |
Week 3 |
|
| 17 March to 20 March, 2008 | Other weeks: - 1 2 3 4 5 6 7 8 9 10 11 12 |
| Study Material | Tasks | Content |
|
Read Textbook: Chapter 14: More About Classes (pp. 807-864) Study the Week 3 Lecture Slides |
Complete Week 3's Tutorial Exercises |
* Instance and static members * Friend functions * Friends of classes * Memberwise assignment * Default constructors * Copy constructors * operator overloading * Object conversion * Aggregation in UML diagrams |
Week 4 |
|
| 25 March to 28 March, 2008 | Other weeks: - 1 2 3 4 5 6 7 8 9 10 11 12 |
| Study Material | Tasks | Content |
|
Read Textbook: Chapter 15: Inheritance, Polymorphism, and Virtual Functions (pp. 877-909) Study the Week 4 Lecture Slides |
Complete Week 4's Tutorial Exercises |
* The notation of inheritance * Protected members and class access * Base classes * Derived classes * Constructors and destructors in base and derived classes * Redefining base class fundtions * Class hierarchies |
Week 5 |
|
| 31 March to 04 April, 2008 | Other weeks: - 1 2 3 4 5 6 7 8 9 10 11 12 |
| Study Material | Tasks | Content |
|
Read Textbook: Chapter 15: Inheritance, Polymorphism, and Virtual Functions (pp. 909- 937) Study the Week 5 Lecture Slides |
Complete Week 5's Tutorial Exercises |
* The notation of polymorphism and virtual functions * Abstract base classes and pure virtual functions * Multiple inheritance |
Week 6 |
|
| 07 April to 11 April, 2008 | Other weeks: - 1 2 3 4 5 6 7 8 9 10 11 12 |
| Study Material | Tasks | Content |
|
Text: Chapter 16: Exception, Templates, and the Standard Template Library (STL) (pp. 951-986) Study the Week 6 Lecture Slides |
Complete Week 6's Tutorial Exercises Assignment 1 is due on Friday |
* The notation of Exception * Throwing an exception * Handling an exception * Function templates * Class templates |
Week 7 |
|
| 21 April to 24 April, 2008 | Other weeks: - 1 2 3 4 5 6 7 8 9 10 11 12 |
| Study Material | Tasks | Content |
|
Text: Chapter 7, Section 7.12 (pp. 428-440); Chapter 8, Section 8.5 (pp. 484-489);
Chapter 16: Exception, Templates, and the Standard Template Library (STL) (pp. 987-1000) Study the Week 7 Lecture Slides -1 ; Week 7 Lecture Slides -2; Week 7 Lecture Slides - 3 |
Complete Week 7's Tutorial Exercises |
* Standard Template Library (STL) * vectors * Sorting and searching vectors * deques * lists * containers * iterators * algorithms |
Week 8 |
|
| 28 April to 02 May, 2008 | Other weeks: - 1 2 3 4 5 6 7 8 9 10 11 12 |
| Study Material | Tasks | Content |
|
Text: Chapter 17: Linked Lists (pp. 1007-1040) Study the Week 8 Lecture Slides |
Complete Week 8's Tutorial Exercises |
* The notation of a Linked List * Linked list operations * A linked list template * Variations of the Linked List * The STL list container |
Week 9 |
|
| 06 May to 09 May, 2008 | Other weeks: - 1 2 3 4 5 6 7 8 9 10 11 12 |
| Study Material | Tasks | Content |
|
Text: Chapter 18: Stacks and Queues (pp. 1047-1064) Study the Week 9 Lecture Slides |
Complete Week 9's Tutorial Exercises |
* The notation of a stack * Dynamic stacks * The STL Stack |
Week 10 |
|
| 12 May to 16 May, 2008 | Other weeks: - 1 2 3 4 5 6 7 8 9 10 11 12 |
| Study Material | Tasks | Content |
|
Text: Chapter 18: Stacks and Queues (pp. 1065-1079) Study the Week 10 Lecture Slides |
Complete Week 10's Tutorial Exercises Assignment 2 due on Friday of the week. |
* The notation of a Queue * Dynamic Queues * The STL deque and queue containers |
Week 11 |
|
| 19 May to 23 May, 2008 | Other weeks: - 1 2 3 4 5 6 7 8 9 10 11 12 |
| Study Material | Tasks | Content |
|
Text: Chapter 19: Recursion (pp. 1087-1119) Study the Week 11 Lecture Slides |
Complete Week 11's Tutorial Exercises |
* The notation of Recursion * Solving problems with recursion * Focus on problem solving and program design: the recursive gcd function * Focus on problem solving and program design: solving recursively defined problems * Focus on problem solving and program design: recursive linked list operations * Focus on problem solving and program design: a recursive binary search function * The towers of Hanoi * Focus on problem solving and program design: the QuickSort algorithm * Exhausive algorithms * Focus on software engineering: recursion vs. iteration |
Week 12 |
|
| 26 May to 30 May, 2008 | Other weeks: - 1 2 3 4 5 6 7 8 9 10 11 12 |
| Study Material | Tasks | Content |
|
Text: Chapter 20: Binary Trees (pp. 1125-1145) Study the Week 12B Lecture Slides |
Complete Week 12's Tutorial Exercises |
* The notation of binary trees * The application of binary trees * Binary search tree operations * Templates considerations for binary search trees |