MonMap
A course mapper by Monash Association of Coding (MAC)
Algorithms and data structures
FIT2004
Synopsis
This unit introduces you to problem solving concepts and techniques fundamental to the science of programming. In doing this it covers problem specification, algorithmic design, analysis and implementation. Detailed topics include analysis of best, average and worst-case time and space complexity; introduction to numerical algorithms; recursion; advanced data structures such as heaps and B-trees; hashing; sorting algorithms; searching algorithms; graph algorithms; and numerical computing.
Sourced from the Monash Handbook 2026.
Quick facts
- Credit points
- 6
- Level
- 2
- Audience
- Undergraduate
- Type
- Coursework
- School
- Faculty of Information Technology
- Handbook year
- 2026
Prerequisites (5)
What it unlocks (15)
- Artificial intelligenceFIT3080
- Parallel computingFIT3143
- Advanced computer science research projectFIT3144
- Advanced data structures and algorithmsFIT3155
- Computer science project 1FIT3161
- Data science project 1FIT3163
- Big data management and processingFIT3182
- Malicious AI and dark side securityFIT3183
- Cybersecurity project 1FIT3188
- Generative artificial intelligence FIT3191
- Emerging and advanced topics in artificial intelligenceFIT3192
- Artificial intelligence project 1FIT3193
- Intelligent agents FIT3203
- Number theory and cryptographyMTH2137
- Computational linear algebraMTH3320
Offerings (4)
- First semesterClayton · FLEXIBLE / Malaysia · ON-CAMPUS
- Second semesterClayton · FLEXIBLE / Malaysia · ON-CAMPUS
Listed in 4 areas of study
- Computational scienceAdditional computational science units
- Computational scienceLevel 2 and 3 computational science
- Computational scienceLevel 2 and 3 computational science
- Computer scienceCore units