Skip to the content | Change text size
PDF unit guide

FIT1029 Algorithmic problem solving - Semester 1, 2012

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; arguing correctness of an algorithm; arguing termination of an algorithm; understanding the efficiency of an algorithm; and limitations of algorithms.

Mode of Delivery

  • Clayton (Day)
  • Sunway (Day)

Contact Hours

2 hrs lectures/wk, 2 hrs tutorials/wk


Students will be expected to spend 12 hours per week on various activities including:

  • two-hour lecture and
  • two-hour tutorial  (requiring advance preparation)
  • a minimum of 2-3 hours of personal study per one hour of contact time in order to satisfy the reading and assignment expectations.
  • You will need to allocate up to 2 hours per week in some weeks, for use of a computer, including time for newsgroups/discussion groups.

Chief Examiner

Campus Lecturer


David Albrecht


Simon Egerton

Academic Overview


At the completion of this unit students will have -
A knowledge and understanding of:
  • the difference between algorithms and processes;
  • basic ways to structure algorithms: basic data structures (simple variables, collections structure, specifically vectors, lists, sets, and tables); basic control structures (sequence, choice, iteration);
  • recursion;
  • modular algorithm structures;
  • the equivalence of recursion and iteration;
  • problem solving strategies suitable for algorithm development including top-down design and bottom-up design;
  • simple standard patterns for algorithms (eg traversal, search);
  • what makes a good algorithm
  • limitations of algorithms (high level).
Developed the skills to:
  • develop simple iterative and recursive algorithms
  • argue the correctness of simple algorithms
  • judge the efficiency of simple algorithms, and
Developed attitudes that enable them to:
  • value clear specification of problems;
  • understand the relation between algorithms and programs;
  • appreciate the value of designing abstract algorithms before starting to code a program;
  • have confidence that they can develop algorithms to solve computational problems;
  • appreciate that seemingly difficult problems can have very simple elegant algorithmic solutions (and vice versa);
  • value correctness arguments for algorithms; and
  • value the importance of simplicity and efficiency.
Demonstrated the communication skills necessary to:
  • solve a problem by discussing possible approaches and solutions as a team; and
  • clearly communicate (the specification of) a computational problem, its algorithmic solution and arguments for correctness and efficiency.

Graduate Attributes

Monash prepares its graduates to be:
  1. responsible and effective global citizens who:
    1. engage in an internationalised world
    2. exhibit cross-cultural competence
    3. demonstrate ethical values
  2. critical and creative scholars who:
    1. produce innovative solutions to problems
    2. apply research skills to a range of challenges
    3. communicate perceptively and effectively

Assessment Summary

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

Assessment Task Value Due Date
Assignment 1 10% Monday 19 March 2012
Assignment 2 15% Monday 7 May 2012
Mid semester test 15% Week 6
Examination 1 60% To be advised

Teaching Approach

Lecture and tutorials or problem classes
This teaching and learning approach provides facilitated learning, practical exploration and peer learning.


Our feedback to You

Types of feedback you can expect to receive in this unit are:
  • Informal feedback on progress in labs/tutes
  • Graded assignments with comments
  • Test results and feedback

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 SETU, Student Evaluation of Teacher and Unit. 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, and on student evaluations, see:

Previous Student Evaluations of this unit

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

Recommended Resources

Recommended Texts are:

  1. Levitin, A., Introduction to the Design and Analysis of Algorithms (2nd Edition), Addison-Wesley, 2006
  2. Harel, D. with Y. Feldman, Algorithmics: The Spirit of Computing, 3rd ed., Pearson Education Limited, 2004.

Unit Schedule

Week Activities Assessment
0   No formal assessment or activities are undertaken in week 0
1 Introduction to the unit and the type of problems  
2 Understanding and modelling the problem  
3 Invariants in problems and data  
4 Decomposition of problems and applying Brute Force to solve problems Assignment 1 due Monday 19 March 2012
5 Using abstraction, symmetry, heuristics and divide and conquer to simplify problems  
6 Recursion Mid semester test
7 Backtracking  
8 Dynamic Programming  
9 Fundamentals  
10 Abstract Data Types and Correctness Assignment 2 due Monday 7 May 2012
11 Complexity  
12 Limitations of algorithms  
  SWOT VAC No formal assessment is undertaken SWOT VAC
  Examination period LINK to Assessment Policy:

*Unit Schedule details will be maintained and communicated to you via your MUSO (Blackboard or Moodle) learning system.

Assessment Requirements

Assessment Policy

Faculty Policy - Unit Assessment Hurdles (

Assessment Tasks


  • Assessment task 1
    Assignment 1
    This assignment will aim to help you understand how to go about finding algorithms to solve problems.
    Criteria for assessment:

    Detailed assessment criteria will be issued along with the assignment.   

    1. All assumptions should be stated.
    2. All algorithms must meet the problem specification.
    3. Students should be able to answer questions about their own work.
    Due date:
    Monday 19 March 2012
  • Assessment task 2
    Assignment 2
    This assignment will help you understand different search techniques. It will also help you communicate and reason about algorithms.
    Criteria for assessment:

    Detailed assessment criteria will be issued along with the assignment.   

    1. All assumptions should be stated.
    2. All algorithms must meet the problem specification.
    3. Students should be able to answer questions about their own work.
    Due date:
    Monday 7 May 2012
  • Assessment task 3
    Mid semester test
    This test will be based on the first 4 weeks of material.
    Criteria for assessment:
    Due date:
    Week 6


  • Examination 1
    3 hours
    Type (open/closed book):
    Closed book
    Electronic devices allowed in the exam:

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).

Online submission

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

Extensions and penalties

Returning assignments

Other Information


Student services

The University provides many different kinds of support services for you. Contact your tutor if you need advice and see the range of services available at For Sunway see, and for South Africa see

The Monash University Library provides a range of services and resources that enable you to save time and be more effective in your learning and research. Go to or the library tab in portal for more information. At Sunway, visit the Library and Learning Commons at At South Africa visit

Academic support services may be available for students who have a disability or medical condition. Registration with the Disability Liaison Unit is required. Further information is available as follows:

  • Website:;
  • Email:
  • Drop In: Equity and Diversity Centre, Level 1 Gallery Building (Building 55), Monash University, Clayton Campus, or Student Community Services Department, Level 2, Building 2, Monash University, Sunway Campus
  • Telephone: 03 9905 5704, or contact the Student Advisor, Student Commuity Services at 03 55146018 at Sunway

Reading list

  1. Levitin, A., Introduction to the Design and Analysis of Algorithms (2nd Edition), Addison-Wesley, 2006
  2. Harel, D. with Y. Feldman, Algorithmics: The Spirit of Computing, 3rd ed., Pearson Education Limited, 2004.
  3. Michalewicz, Z. and M. Michalewicz, Puzzle-Based Learning: An introduction to critical thinking, mathematics, and problem solving, Hybrid Publishers, 2008.
  4. Polya, G., How to solve it; a new aspect of mathematical method, 2nd ed., Garden City, N.Y., Doubleday, 1957
  5. Bentley, J., Programming Pearls, Addison-Wesley, 1986
  6. Bentley, J., More Programming Pearls: confessions of a coder, Addison-Wesley,  1988
  7. Skiena, S., The Algorithm Design Manual, TELOS--the Electronic Library of Science, 1998
  8. Cormen, T., C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, The MIT Press, 1990