FIT2004 : Algorithms and Data Structures

Overview

This repository contains my complete work for FIT2004.

• Random problem solutions (problems/)
• Past exam papers & their solutions for some (exams/)
• Implementations of standard algorithms (graph, sorting, searching).
• Data-structure implementations in data_structures/.
• Dynamic programming in dp/.
• Weekly problem sets and solutions in wk01/ ... wk12/.

Repository Structure

┌── .exams/ # Past exam papers + solutions
├── algorithms_graph/ # Graph algorithms (Ford–Fulkerson, Dijkstra, DFS, BFS, etc.)
├── algorithms_searching/ # Searching algorithms (binary search, and more)
├── algorithms_sorting/ # Sorting algorithms (merge, quick, insertion, etc.)
├── data_structures/ # BST, AVL, 2-3 Tree, Trie, RBT, etc.
├── dp/ # Dynamic programming problems (knapsack, coins, fib, …)
├── problems/ # Random problem solutions
├── wk01/ … wk12/ # Weekly tutorial problem sets & solutions
├── README.md # ← You are here
├── requirements.txt # Python dependencies
└── .gitignore

Running Examples

Each folder contains a __main__ section.

You can just run the file e.g.

python algorithms_sorting/insertion_sort.py

Past Exams

Browse exams/ for PDFs of past papers and their solutions.

Repository was maintained by Jenul Ferdinand whilst studying FIT2004 at Monash University