| Course Information
Lecture Notes
|
Lecture Notes
Textbook: Starting Out with C++: From Control Structures
through Objects, 5/e, Tony Gaddis, 2007.
Lecture No. |
Topics |
Readings |
Homework |
1 |
1. Basics of data structures and algorithms
|
Textbook,
chapter 1-7 |
|
2 |
2. Searching and Sorting Arrays -- quicksort
demo |
Textbook,
chapter 8 |
|
3 |
Exercises |
|
|
4 |
3. Pointers Midterm
Exam |
Textbook,
chapter 9 |
|
5 |
4. Structured Data |
Textbook,
chapter 11 |
|
6 |
Exercises |
|
|
7 |
5. Classes
Solution for Exercise 1: employee.h, employee.cpp,
test.cpp
Solution for Exercise 2: savingaccount.h,
savingaccount.cpp, driver.cpp
|
Textbook,
chapter 13,14 |
|
8 |
Exercises
Midterm
Exam |
|
|
9 |
6. Inheritance, Polymorphism, and Virtual Functions |
Textbook,
chapter 15 |
|
|
10 |
7. Linked List |
Textbook,
chapter 16 |
|
11 |
Exercises |
|
|
12 |
8. Stack and Queues
|
|
|
13 |
Exercises |
|
|
14 |
8. Stack and Queues (continue) |
|
|
15 |
Exercises |
previous exams |
|
|
Final Exam |
|
|
Policies:
- Students have to submit their own individual homework to the lecturer
by email (to huonglt@soict.hust.edu.vn)
one week after the homework is given in class. Each homework is stored
in one file in the *.txt or *.doc format.
The filename is the student's fullname (e.g.,
ngothanhbinh.doc). The title of the email should be "Homework".
- If the homework of two students are similar, marks will be reduced
by 50%.
- If the homework is submitted one week late, mark is reduced by 30%.
After that, no submission is accepted.
|