FIT2085 - Introduction to computer science for engineers - 2018

This unit introduces students to core problem-solving, analytical skills, and methodologies useful for developing flexible, robust, and maintainable software. In doing this it covers a range of conceptual levels, from high level algorithms and data-structures, down to the machine models and simple assembly language programming. Topics include data types; data structures; algorithms; algorithmic complexity; recursion; and translation to assembly language.

At the completion of this unit, students should be able to:

1. translate problem statements into algorithms and implement them in a high level programming language;
2. summarise and compare the properties of basic abstract data types such as stacks, queues, lists, trees, priority queues, heaps and hash tables;
3. theoretically and experimentally evaluate different implementations of basic abstract data types;
4. analyse algorithms by determining their best case and worst case big O time complexity;
5. implement and evaluate different strategies for solving a given problem;
6. recognise the limitations - both theoretical and practical - of algorithms;
7. de-construct simple high-level code into assembly code such as MIPS R2000.

Examination (3 hours): 60%; In-semester assessment: 40%

Minimum total expected workload equals 12 hours per week comprising:

1. Contact hours for on-campus students:
   • Three 1-hour lectures
   • One 1-hour tutorial
   • One 3-hour laboratory
2. Additional requirements (all students):
   • A minimum of 5 hours of personal study per week in order to satisfy the reading and assignment expectations.

See also Unit timetable information

Software engineering