The BCS and BSE curriculum offers first year students hardly any introductory training for the design of algorithms and for thinking about algorithms in a structured, semi-formal fashion. This prepares them inadequately for the second semester core unit FIT1008 and thus for FIT2004 and the remainder of the curriculum. The current introductory programming unit FIT1002 does not provide an adequate preparation in this regard, as it focuses on the technical aspects of programming/coding, but does not contain a sufficient amount of material on problem solving to enable students to become confident with algorithm design. Historically, CSE1301 used to take this role. However, when this unit was replaced by FIT1002 many parts of the syllabus were dropped (including discussion of the nature of algorithms, structured approaches to algorithmic problem solving, discussion of algorithmic correctness and complexity, recursion, as well as advanced exercises on these topics).

The result of these gaps in the preparation are evident in FIT1008: While most students who passed FIT1002 can code a simple algorithm if given its description, many of them are still unable to design even simple iterative algorithm, and most of them have difficulties to adequately communicate problem specifications and algorithm designs in pseudo-code or other forms. Onflow effects manifest themselves in subsequent core units, specifically FIT2004. It is not possible to absorb this material in FIT1008, as this is already a very dense unit. The BCS and BSE courses have a relatively tight progression of core units from year 1 to year 3. The onflow effects of trying to absorb the material covered by this unit into FIT1008 would thus propagate through FIT2004 and FIT3014 and beyond third year level. It is therefore not possible to cover all this material in FIT1008.

30/11/2017 - Unit disestablished at FEC 5/17 Item 7.3.

27/05/2014 - Admin: minor edit to add first sentence to learning outcomes.

To prepare for TEQSA the objectives have been changed to learning outcomes. Also, so that more time can be spent on problem solving strategies, the concept of ADTs and proving correctness of algorithms have been removed from the syllabus. This change will be introduced in Semester 2, 2013.

Removed prohibition statement as this is confusing students enrolled in non-FIT degrees (science, engineering etc and is not enforceable). This change will be introduced in Semester 1, 2012.

This unit has been updated as part of a 2009 review and comparison of data with current Handbook, Syllabus + and Callista data.

This unit is a level 1 core unit in the BCS/BSE. In both degrees the unit will take up an elective slot in Year 1, Semester 1. To compensate for this reduction in free electives, the BCS will convert one Level 3 CSE elective into a free Level 3 elective.

There are no similar units in the faculty. It is important not to mistake this unit for a programming introduction. Its purpose is to teach algorithmic problem solving, the design of simple algorithms, and structured thinking about correctness of algorithms. It does not train the students in coding/programming. This is the task of FIT1002 and more advanced programming units. Thus, the new unit does not overlap significantly with FIT1002 or FIT1008 but complements them and fills the gap student's encounter in the transition from FIT1002 to FIT1008. The inclusion of this unit in the curriculum significantly raises educational standards in the BCS and BSE, while simultaneously allowing us to achieve higher pass rates in the core units FIT1008 and FIT2004. The unit is thus highly relevant.

The introduction of this unit into the curriculum allows Monash-FIT to distinguish itself with a contemporary Computer Science/Software Engineering curriculum that is not centred on programming, but instead focused on systematic problem solving with computational methods.

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

020109

Algorithms are recipes for solving a problem. They are fundamental to computer science and software engineering. Algorithms are the formal foundation of computer programming but also exist independently of computers as systematic problem-solving procedures. This unit introduces algorithmics, the study of algorithms. It is not about programming and coding but rather about understanding and analysing algorithms and about algorithmic problem-solving, i.e. the design of systematic problem-solving procedures. The unit will not require any knowledge of a programming language and is very hands-on. Students will develop algorithms to solve a wide variety of different problems, working individually as well as together in groups and as a class.

Topics include: What is a computational problem and what is an algorithm; basic control structures; basic data structures; modular algorithm structure; recursion; problem-solving strategies for algorithm development; understanding the efficiency of an algorithm; and limitations of algorithms.

on campus

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

Minimum total expected workload equals 12 hours per week comprising:

(a.) Contact hours for on-campus students:

(b.) Additional requirements (all students):

Tutorials must follow lectures.

FIT