units

FIT4010

Faculty of Information Technology

Skip to content | Change text size
 

print version

Monash University Handbook 2011 Undergraduate, Postgraduate - Unit

6 points, SCA Band 2, 0.125 EFTSL

Refer to the specific census and withdrawal dates for the semester(s) in which this unit is offered.

LevelUndergraduate, Postgraduate
FacultyFaculty of Information Technology
OfferedClayton First semester 2011 (Day)

Synopsis

Algorithms are the most fundamental area for all aspects of computer science and software engineering. Discrete structures, such as those treated in graph theory, set theory, combinatorics and symbolic logic form the mathematical underpinning of the study of algorithms. As well-designed algorithms and data structures are essential for the good performance of an information system, an in-depth understanding of the theoretical properties of algorithms is essential for any computer scientist. As importantly, the theoretical investigation of algorithms leads to a deeper understanding of problem structures and classes of problems and the knowledge of a large variety of algorithm types enables the designer to approach a new problem from different angles. Topics for this unit include: Computability and Complexity Automata Theory Advanced Analysis and Design of Algorithms Parallel and Distributed Algorithms Numerical Algorithms Cryptographic algorithms Spatial/geometric algorithms

Objectives

At the completion of this unit students will have:

  • an improved understanding of the issues involved in designing algorithms in the chosen specialisation area(s) and in analysing their performance;
  • an understanding of the mathematical formalisms that are relevant for these algorithms;
  • learned to recognise tasks that can be solved with these algorithms;
  • the ability to judge the limitations of these methods.With successful completion of the unit the students;
  • the ability to choose and apply algorithms and data structures in the chosen specialisation area(s);
  • the ability to evaluate the performance of algorithms using formal approaches;
  • the ability to design modified algorithms in the chosen area to suit particular problem structures.

Assessment

Assignment and Examination, relative weight depending on topic composition. When no exam is given students will be expected to demonstrate their knowledge by solving practical problems and maybe required to give an oral report.

Contact hours

2 hrs lectures/wk, 1 hr laboratory or tutorial/wk

Prerequisites

Completion of the Bachelor of Computer Science or equivalent to the entry requirements for the Honours program. Students must also have enrolment approval from the Honours Coordinator.

Additional information on this unit is available from the faculty at:

http://www.infotech.monash.edu.au/units/fit4010