FIT2085 Fundamentals of algorithms for engineers

When you finish this unit, you should be able to:

1. 1

   Semester 2: Analyse computational problems to identify suitable algorithmic strategies, data representations and performance considerations.

   Semester 1: Translate problem statements into algorithms and implement them in a high level programming language;

2. 2

   Semester 2: Demonstrate understanding of data structures and algorithms by implementing, using, and testing them in ways that support correctness, readability and maintainability.

   Semester 1: Determine appropriate basic abstract data types, including; stacks, queues, lists, binary trees, priority queues, heaps and hash tables; for specific contexts;

3. 3

   Semester 2: Design modular algorithmic solutions using appropriate abstract data types, including lists, stacks, queues, trees, heaps and hash tables.

   Semester 1: Theoretically and experimentally evaluate different implementations of basic abstract data types;

4. 4

   Semester 2: Demonstrate awareness and working knowledge of relevant tools and technologies, and use them effectively to increase productivity and improve quality, such as IDEs, AI, and Version Control Systems.

   Semester 1: Analyse the efficiency of algorithms by determining their best-case and worst-case big-O time complexity;

5. 5

   Semester 2: Plan, monitor, and reflect on the development of your algorithmic thinking and implementation practice through focused problem solving, feedback and iterative improvement.

6. 6

   Semester 2: Communicate algorithmic reasoning and correctness, implementation choices, performance trade-offs and testing evidence using appropriate technical terminology and representations.