FIT3234 · Monash University
Data structures and algorithms 2
- Credit points
- 6
- Level
- 3
- Workload
- ≈ 12 h / week
- Faculty
- Information Technology
What it covers
This unit deepens study of algorithms and data structures by moving from introductory programming patterns to more formal design, analysis, and proof-oriented reasoning. It covers advanced data structures, graph and numerical algorithms, recursion, and systematic analysis of best-case, average-case, and worst-case time and space complexity. It also introduces selected advanced topics such as amortised reasoning and more sophisticated problem-solving strategies. You will learn to compare algorithmic paradigms, justify correctness, and implement efficient solutions to non-trivial computational problems, building the intellectual bridge from foundational coding to essential computer science knowledge.
Assessment
| Task | Type | Weight |
|---|---|---|
| Learning Portfolio | Portfolio | 100% |
When and where
| Teaching period | Campus | Mode |
|---|---|---|
| First semester | Clayton | Flexible |
| Malaysia | On-campus | |
| Second semester | Clayton | Flexible |
| Malaysia | On-campus |