Skip to the content | Change text size
PDF unit guide

FIT4012 Advanced topics in computational science - Semester 2, 2014

All sciences are increasingly relying on computational support and the growth of many branches of science has only become possible due to the availability of efficient computational methods. The common basis of such methods are; numerical methods and high performance computing. Topics for this unit include: Numerical Methods, High Performance and Parallel Computing, Optimisation and Operations Research Bioinformatics, Simulation, Visualisation and Modelling.

Mode of Delivery

Clayton (Day)

Workload Requirements

Minimum total expected workload equals 12 hours per week comprising:

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

  • Two hours of lectures

(b.) Additional requirements (all students):

  • A minimum of 10 hours independent study per week for completing lab and project work, private study and revision.

Unit Relationships


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.

Chief Examiner

Campus Lecturer


Aldeida Aleti

Julian Garcia

Your feedback to Us

Monash is committed to excellence in education and regularly seeks feedback from students, employers and staff. One of the key formal ways students have to provide feedback is through the Student Evaluation of Teaching and Units (SETU) survey. The University’s student evaluation policy requires that every unit is evaluated each year. Students are strongly encouraged to complete the surveys. The feedback is anonymous and provides the Faculty with evidence of aspects that students are satisfied and areas for improvement.

For more information on Monash’s educational strategy, see: and on student evaluations, see:

Previous Student Evaluations of this Unit

Student feedback has shown the unit is structured well. To make sure materials are current lecture notes have been updated and new visual references have been added.

If you wish to view how previous students rated this unit, please go to

Academic Overview

Learning Outcomes

At the completion of this unit students should be able to:
  • explain the role of computational methods in the chosen field of specialisation and their relation to complimentary and related approaches;
  • solve non-trivial problems using the algorithms specific to the chosen field of specialisation;
  • compare and evaluate alternative computational approaches in the chosen domain in terms of performance and suitability to a specific problem;
  • critically evaluate the limits and capabilities of these methods;
  • select, design and test computer programs in the domain;
  • use standard computational packages in the chosen domain effectively for practical problem solving where appropriate.

Unit Schedule

Week Activities Assessment
0 Review recommended reading No formal assessment or activities are undertaken in week 0
1 Evolutionary Computation for Optimisation and Simulation  
2 Combinatorial Problems and Computational Complexity  
3 Systematic, Local and Stochastic Search  
4 Fitness Landscape Analysis  
5 Parameter Control for Evolutionary Algorithms  
6 Constrained Problems and Constraint-Handling Techniques Problem Set 1 due Week 6, Friday, 5pm
7 Co-evolution, Co-evolutionary algorithms, Evolutionary Models  
8 Fundamentals of Game Theory  
9 Evolutionary dynamics I  
10 Evolutionary dynamics II  
11 Agent-based models of evolution and applications  
12 Project presentations Research Project due Week 12; Problem Set 2 due Week 14, Friday, 5pm
  SWOT VAC No formal assessment is undertaken in SWOT VAC
  Examination period LINK to Assessment Policy:

*Unit Schedule details will be maintained and communicated to you via your learning system.

Teaching Approach

Research activities
Students are encouraged to explore the research literature, combined with practical problem-solving and learning support from their lecturers.

Assessment Summary

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.

Assessment Task Value Due Date
Problem Set 1 40% Week 6, Friday, 5pm
Problem Set 2 40% Week 14, Friday, 5pm
Research Project 20% Week 12

Assessment Requirements

Assessment Policy

Assessment Tasks


  • Assessment task 1
    Problem Set 1
    Problem solving and programming exercises on combinatorial problems, computational complexity and search paradigms. The assessment questions will be available from Week 1.
    Criteria for assessment:
    • Correctness
    • Accuracy
    • Efficiency
    • Quality of documentation
    • Quality of results
    • Evidence of testing
    • Statistical analysis
    • Coding use
    • Inventiveness of solutions
    Due date:
    Week 6, Friday, 5pm
  • Assessment task 2
    Problem Set 2
    Problem solving and programming exercise on Evolutionary Simulation. The assessment questions will be available from Week 7.
    Criteria for assessment:
    • Correctness and accuracy of the solution
    • Efficiency of the algorithm
    • Complexity analysis
    • Use of appropriate programming practices
    Due date:
    Week 14, Friday, 5pm
  • Assessment task 3
    Research Project
    Prepare a research proposal or presentation on a research topic. The lecturer will provide a list of possible topics. 
    Criteria for assessment:

    Marks will be awarded based on the criteria listed below. The questions listed indicate the kind of questions that will be asked when your work is assessed.

    - Logical structure: is the proposal or presentation well structured? Does it present its material in a logical and clear way?

    - Writing quality: does every word count? Has the author avoided padding out the text with waffle in order to get to the necessary word count? Are the main points of the paper clear and convincing, with solid arguments and proper referencing to the literature?

    - Language, spelling and grammar: has the paper been proof-read? Are there spelling mistakes? Do sentences make sense? Are there any grammatical errors? Is it easy to establish what the writer is trying to say?

    - Quality of analysis: how well has the topic being researched? How clearly does it establish the important points and arguments. Are the references appropriate and adequate?

    - Original contribution: what does the paper contribute to the topic beyond just listing opinions or work done by others? How original is the paper?

    Due date:
    Week 12
    Please note that it is important to correctly attribute material that is not your own. Your paper will contain a bibliography, listing the work of others that you have consulted. The number of references you consult is up to you, as a rough guide most papers of this size will have somewhere between 6 - 20 references. Do not bulk up your bibliography with unnecessary references or ones that you have not actually read. Consider the authority and origin of your research sources. Favour books, journals and conference proceedings that are peer reviewed and from reputable publishers over web pages, for example. At least 80% of your references should originate from sources other than the Internet (electronic versions of journal or conference papers can count towards this quota).

Learning resources

Reading list

Sean Luke (2009): "Essentials of Metaheuristics", Lulu, Available for free download at:

A.E. Eiben and J.E. Smith (2007): "Introduction to Evolutionary Computing", (2nd Edition) Springer, Natural Computing Series

Stochastic Local Search, Foundations and Applications, by Holger H. Hoos and Thomas Stützle,

How to Solve It: Modern Heuristics, by Zbigniew Michalewicz and David B. Fogel,

M.A Nowak (2006): "Evolutionary dynamics: exploring the equations of life". Havard University Press.


Monash Library Unit Reading List (if applicable to the unit)

Faculty of Information Technology Style Guide

Feedback to you

Examination/other end-of-semester assessment feedback may take the form of feedback classes, provision of sample answers or other group feedback after official results have been published. Please check with your lecturer on the feedback provided and take advantage of this prior to requesting individual consultations with staff. If your unit has an examination, you may request to view your examination script booklet, see

Types of feedback you can expect to receive in this unit are:

  • Informal feedback on progress in labs/tutes
  • Graded assignments with comments

Extensions and penalties

Returning assignments

Assignment submission

It is a University requirement ( for students to submit an assignment coversheet for each assessment item. Faculty Assignment coversheets can be found at Please check with your Lecturer on the submission method for your assignment coversheet (e.g. attach a file to the online assignment submission, hand-in a hard copy, or use an online quiz). Please note that it is your responsibility to retain copies of your assessments.

Online submission

If Electronic Submission has been approved for your unit, please submit your work via the learning system for this unit, which you can access via links in the portal.

Recommended Resources

Access to a C, C++ or Java compiler and IDE environment. These are available in University computer labs.

Other Information


Monash has educational policies, procedures and guidelines, which are designed to ensure that staff and students are aware of the University’s academic standards, and to provide advice on how they might uphold them. You can find Monash’s Education Policies at:

Key educational policies include:

Faculty resources and policies

Important student resources including Faculty policies are located at

Graduate Attributes Policy

Student Charter

Student services

Monash University Library

Disability Liaison Unit

Students who have a disability or medical condition are welcome to contact the Disability Liaison Unit to discuss academic support services. Disability Liaison Officers (DLOs) visit all Victorian campuses on a regular basis.