FIT3155 · Monash University
Advanced data structures and algorithms
- Credit points
- 6
- Level
- 3
- Workload
- ≈ 12 h / week
- Faculty
- Information Technology
What it covers
This unit builds on the concepts learnt in introductory algorithms and data structures study. It covers advanced algorithmic paradigms and problem-solving techniques required to address real-world programming challenges. It explores, in depth, the design and analysis of space-efficient data structures and time-efficient problem solving strategies to be used with them. Topics include amortized analysis, advanced sorting and searching algorithms, new tree/string/graph data structures and algorithms, and number-theoretic algorithms amongst others.
Assessment
| Task | Type | Weight |
|---|---|---|
| Assignment 1 | Artefact | 20% |
| Assignment 2 | Artefact | 20% |
| Scheduled final assessment (2 hours and 10 minutes) | Examination | 60% |
When and where
| Teaching period | Campus | Mode |
|---|---|---|
| First semester | Malaysia | On-campus |
| Clayton | Flexible | |
| Second semester | Malaysia | On-campus |
| Clayton | Flexible |