Home | About Us | Courses | Units | Student resources | Research |
IT Support | Staff directory | A-Z index |
M O N A T A R |
InfoTech Unit Avatar |
This field records the Chief Examiner for unit approval purposes. It does not publish, and can only be edited by Faculty Office staff
To update the published Chief Examiner, you will need to update the Faculty Information/Contact Person field below.
NB: This view restricted to entries modified on or after 19990401000000
FIT9059 is a choice of foundation unit for the Master of Data Science (MDataSci) (non-cognate entry) and a core unit in the for those non-cognate entries doing the Data Analytics stream, beginning in 2016.
09/02/2016: Admin adding reason for change - specified Mac Labs in Special Timetabling Requirements under Workloads.
28/09/2015 - minor wording change to learning outcomes as per email from GPC Chair Judy Sheard.
24/9/2015: Changes made by Ann Nicholson to align the structure (exam/non-exam assessment breakdown, and workload/classes) with standards for Masters units. Also added explicit mention of the Python programming language.
FIT9059 is a choice of foundation unit for the Master of Data Science (MDataSci) (non-cognate entry) and a core unit in the for those non-cognate entries doing the Data Analytics stream, beginning in 2016.
At the completion of this unit, students should be able to:
020109 Algorithms
This unit introduces students to problem solving concepts and techniques fundamental to the science of programming. It covers data types; data structures; algorithms; algorithmic complexity; and recursion. Detailed topics include analysis of best and worst-case time complexity; data structures such as lists, stacks, queues, binary search trees, graphs and heaps; hashing; sorting algorithms; searching algorithms; and graph algorithms. Students will implement these algorithms and data structures in the Python programming language.
Minimum total expected workload equals 12 hours per week comprising:
(a.) Contact hours for on-campus students:
(b.) Additional requirements (all students):
Mac labs
FIT
FIT9131 or any equivalent introductory programming unit
Students beginning FIT9059 are assumed to be able to: Identify the main components of an algorithm (variables, operators, expressions, etc.), and write the algorithm that satisfies the specification of a simple problem. Be able to translate a simple algorithm into a program containing variable declarations, selection, repetition, lists and arrays.
2016
Caulfield
Wray Buntine
03 Aug 2016 | FIT Admin | Data from copied into this unit |
This version:
Copyright © 2022 Monash University ABN 12 377 614 012 – Caution – CRICOS Provider Number: 00008C Last updated: 20 January 2020 – Maintained by eSolutions Service desk – Privacy – Accessibility information |