FIT2115 · Monash University
Data structures and algorithms 1
- Credit points
- 6
- Level
- 2
- Workload
- ≈ 12 h / week
- Faculty
- Information Technology
What it covers
Data structures and algorithms are the tools that allow programs to solve problems efficiently, reliably and at scale. This unit develops the core algorithmic thinking and implementation skills needed to move from a problem statement to a well-structured computational solution. You will learn to represent problems using appropriate data structures, design algorithms that use those structures effectively, and reason about how choices affect correctness, performance and maintainability. The unit covers abstract data types, recursion, introductory complexity analysis, and structures such as stacks, queues, lists, trees, heaps and hash tables. You will evaluate algorithm behaviour both theoretically and experimentally, building a practical understanding of time, space and trade-offs. Through structured programming activities, you will strengthen your ability to design, implement, test and explain algorithmic solutions. The unit builds disciplined habits of precise reasoning, careful coding, performance awareness and reflection, preparing you for later study in advanced algorithms, software design, artificial intelligence, systems and computational problem solving.
Assessment
| Task | Type | Weight |
|---|---|---|
| Theory test | Quiz / Test | 0% |
| 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 |