| << Chapter < Page | Chapter >> Page > |
Task 1: Read the following:
Task 2: Do the following exercises:
These exercises are NOT homework questions.
They are for helping you understand the materials of this unit
Textbook
Textbook
Unit 5. Binary search trees
Task 1: Read the following:
Task 2: Do the following exercises:
These exercises are NOT homework questions.
They are for helping you understand the materials of this unit
Textbook
Textbook
Unit 6. Sorting (part one)
Task 1: Read the following:
Task 2: Do the following exercises:
These exercises are NOT homework questions.
They are for helping you understand the materials of this unit
Textbook
Textbook
Unit 7. Sorting (part two)
Task 1: Read the following:
Task 2: Do the following exercises:
These exercises are NOT homework questions.
They are for helping you understand the materials of this unit
Textbook
Textbook
Unit 8. Graphs (part one)
Task 1: Read the following:
Task 2: Do the following exercises:
These exercises are NOT homework questions.
They are for helping you understand the materials of this unit
Textbook
Textbook
Unit 9. Graphs (part two)
Task 1: Read the following:
Task 2: Do the following exercises:
These exercises are NOT homework questions.
They are for helping you understand the materials of this unit
Textbook
Textbook
Unit 10. Hashing (part one)
Task 1: Read the following:
Task 2: Do the following exercises:
These exercises are NOT homework questions.
They are for helping you understand the materials of this unit
Textbook
Textbook
Unit 11. Hashing (part two)
Task 1: Read the following:
Task 2: Do the following exercises:
These exercises are NOT homework questions.
They are for helping you understand the materials of this unit
Textbook
Textbook
| WEEK | TOPICS | ASSIGNMENTS |
| 1 | Introduction to Data Structure and Algorithms | |
| 2 | Stack and Queue | Assignment problem 1 or Assignment problem 2 |
| 3 | Linked lists | |
| Submit homework 1 and 2 | ||
| 4 | Recursion | |
| 5 | Binary search trees | |
| Submit homework 3 and 4 | Submit assignment problems 1 and 2 | |
| 6 | Sorting (part one) | Assignment problem 3 or Assignment problem 4 |
| 7 | Middle exam (from week 2 to week 5) | |
| 8 | Sorting (part two) | |
| Submit homework 5 | ||
| 9 | Graphs (part one) | |
| 10 | Graphs (part two) | |
| Submit homework 6 | ||
| 11 | Hashing (part one) | Submit assignment problems 3 and 4 |
| 12 | Hashing (part two) | |
| Submit homework 7 | ||
| 13 | Final exam |
Assignment problem 1 - Depth First Search and The N-Queens Problem (4 weeks)
(See assignment problem link for details)
Assignment problem 2 - Greedy Search and The N-Queens Problem (4 weeks)
(See assignment problem link for details)
Assignment problem 3 - Finding a maximum weight matching in a weighted bipartite graph (6 weeks)
(See assignment problem link for details)
Assignment problem 4 - Stable marriage problem (6 weeks)
(See assignment problem link for details)
Homework 1. Stack and Queue – 7 exercises
(See exercises link for details)
Homework 2. Linked lists – 4 exercises
(See exercises link for details)
Homework 3. Designing algorithms – 3 exercises
(See exercises link for details)
Homework 4. Binary Search Trees – 20 exercises
(See exercises link for details)
Homework 5. Sorting – 19 exercises
(See exercises link for details)
Homework 6. Graphs – 5 exercises
(See exercises link for details)
Homework 7. Hashing – 12 exercises
(See exercises link for details)
Notification Switch
Would you like to follow the 'Data structures and algorithms' conversation and receive update notifications?
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|