UnitLevel 1Undergraduate

FIT1053 Algorithms and programming in python (advanced)

Faculty of Information Technology

FIT1053 Algorithms and programming in python (advanced) is a level 1, 6-credit-point, undergraduate unit from the Faculty of Information Technology, offered in 2020 in Semester 1 at Clayton. It has no prerequisites and unlocks 8 units, leading on to 12 units in all.

Credit points
6
Offered in 2020
Semester 1
Clayton
Workload
12 hours
per semester

This is the 2020 handbook entry. See the 2026 entry.

Reviews

No reviews yet

No reviews yet. Be the first to review FIT1053.

Requisites

Enrolment rules

Prerequisite: Students must be enrolled in the Bachelor of Computer Science Advanced (Honours) (C3001) or have achieved an ATAR score of 95 or above and have completed VCE Mathematics Methods or Specialist Mathematics units 3 & 4 with a study score of 25 or MTH1010.

Overview

This unit introduces programming fundamentals and the Python language to students. The unit provides a foundational understanding of program design and implementation of algorithms to solve simple problems. Fundamental programming control structures, built in and complex data types and mechanisms for modularity will be presented in Python.

Topics covered will include basic input and output, program control structures, basic data structures and modular program structure. Problem-solving strategies and techniques for algorithm development, iteration and recursion, algorithm efficiency and the limitations of algorithms will be introduced.

Offerings in 2020

Teaching periodCampusMode
First semesterClaytonOn campus
First semester (Fully flex)ClaytonFlexible

Learning outcomes

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

  1. 1

    Translate between problem descriptions and program designs with appropriate input/output representations;

  2. 2

    Choose and implement appropriate problem solving strategies;

  3. 3

    Analyse the behaviour of programs and data structures;

  4. 4

    Decompose problems into simpler problems and reduce unknown to known problems;

  5. 5

    Determine the computational cost and limitations of algorithms;

  6. 6

    Demonstrate and test the correctness of algorithms.

Workload and teaching

Minimum total expected workload equals 12 hours per week comprising:

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

  • Two hours lectures
  • Two hours laboratories
  • Two hours tutorials

(b.) Additional requirements (all students):

  • A minimum of 2-3 hours of personal study per one hour of lecture time in order to satisfy the reading, tutorial, laboratory and assignment expectations.

Where it fits

FIT1053 is part of 3 areas of study in the 2020 handbook.

Contacts

Chief Examiners
Dr Mario Boley

Common questions

What are the prerequisites for FIT1053?

FIT1053 has no prerequisites, but enrolment rules apply.

What can I take after FIT1053?

FIT1053 is a prerequisite or corequisite for 8 units, including FIT2095, FIT2101, FIT2107, FIT3171, FIT3173 and FIT3175. Those lead on to 12 units in all.

When is FIT1053 offered?

In 2020, FIT1053 runs in Semester 1 at Clayton.

How much work is FIT1053?

The handbook expects about 12 hours of study across the semester. No students have rated its difficulty yet.

Which majors and minors include FIT1053?

FIT1053 is part of Computational science.

More details

Credit points
6
Level
1
Study level
Undergraduate
Faculty
Faculty of Information Technology
Type
Coursework
EFTSL
0.125
Student contribution
SCA Band 2
Study abroad
Not available
Handbook years
2020202120222023202420252026