FIT1029 Algorithmic problem solving - Semester 2, 2010

Clayton

Prerequisites

Co-requisites

Teaching approach

This unit will be delivered via two one hour lectures. Lecturers will describe various puzzles and problems, go through specific approaches for solving the problems, present various algorithms, and analyse these algorithms.

In tutorials students will discuss in-depth various puzzles and problems, practice communicating algorithms, and investigate the fundamental and interesting aspects about algorithms which will help them programming in other units.

Timetable information

For information on timetabling for on-campus classes please refer to MUTTS, http://mutts.monash.edu.au/MUTTS/

Tutorial allocation

On-campus students should register for tutorials/laboratories using the Allocate+ system: http://allocate.its.monash.edu.au/

Unit Schedule

*Please note that these dates may only apply to Australian campuses of Monash University. Off-shore students need to check the dates with their unit leader.

Prescribed text(s) and readings

No text books are required.

Recommended text(s) and readings

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

Equipment and consumables required or provided

Students studying off-campus are required to have the minimum system configuration specified by the Faculty as a condition of accepting admission, and regular Internet access. On-campus students, and those studying at supported study locations may use the facilities available in the computing labs. Information about computer use for students is available from the ITS Student Resource Guide in the Monash University Handbook. You will need to allocate up to 2 hours per week for use of a computer, including time for newsgroups/discussion groups.

Study resources

Study resources we will provide for your study are:

• A MUSO unit web site where lecture slides, weekly tutorial requirements, assignment specifications, and supplementary material will be available
• Discussion groups via MUSO.
• This Unit Information outlining the administrative information for the unit

Overview

Faculty assessment policy

To pass a unit which includes an examination as part of the assessment a student must obtain:

• 40% or more in the unit's examination, and
• 40% or more in the unit's total non-examination assessment, and
• an overall unit mark of 50% or more.

If a student does not achieve 40% or more in the unit examination or the unit non-examination total assessment, and the total mark for the unit is greater than 50% then a mark of no greater than 49-N will be recorded for the unit.

Assignment tasks

Assignment coversheets

Assignment coversheets are available via "Student Forms" on the Faculty website: http://www.infotech.monash.edu.au/resources/student/forms/
You MUST submit a completed coversheet with all assignments, ensuring that the plagiarism declaration section is signed.

Assignment submission and return procedures, and assessment criteria will be specified with each assignment.

Assignment submission and preparation requirements will be detailed in each assignment specification. Submission must be made by the due date otherwise penalties will be enforced. You must negotiate any extensions formally with your campus unit leader via the in-semester special consideration process: http://www.infotech.monash.edu.au/resources/student/equity/special-consideration.html.

• Assignment task 1

  Title:

  Assignment 1

  Description:

  This assignment will aim to help you understand how to go about finding algorithms to solve problems.

  Weighting:

  10%

  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:

  August 9th

• Assignment task 2

  Title:

  Assignment 2

  Description:

  This assignment will aim to help you the importance of fundamental concepts, such as invariants, divide and conquer, and induction in developing algorithms.

  Weighting:

  15%

  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:

  September 6th

• Assignment task 3

  Title:

  Assignment 3

  Description:

  This assignment will help you understand different search techniques. It will also help you communicate and reason about algorithms.

  Weighting:

  15%

  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:

  October 4th

Examination

• Weighting:

  60%

  Length:

  3 hours

  Type (open/closed book):

  Closed book

  Electronic devices allowed in the exam:

  None

Due dates and extensions

Please make every effort to submit work by the due dates. It is your responsibility to structure your study program around assignment deadlines, family, work and other commitments. Factors such as normal work pressures, vacations, etc. are not regarded as appropriate reasons for granting extensions. Students are advised to NOT assume that granting of an extension is a matter of course.

Students requesting an extension for any assessment during semester (eg. Assignments, tests or presentations) are required to submit a Special Consideration application form (in-semester exam/assessment task), along with original copies of supporting documentation, directly to their lecturer within two working days before the assessment submission deadline. Lecturers will provide specific outcomes directly to students via email within 2 working days. The lecturer reserves the right to refuse late applications.

A copy of the email or other written communication of an extension must be attached to the assignment submission.

Refer to the Faculty Special consideration webpage or further details and to access application forms: http://www.infotech.monash.edu.au/resources/student/equity/special-consideration.html

Late assignment

Assignments received after the due date will be subject to a penalty of 5% per day, including weekends. Assignments received later than one week (seven days) after the due date will not normally be accepted. In some cases, this period may be shorter if there is a need to release sample solutions.

This policy is strict because comments or guidance will be given on assignments as they are returned, and sample solutions may also be published and distributed, after assignment marking or with the returned assignment.

Return dates

Students can expect assignments to be returned within two weeks of the submission date or after receipt, whichever is later.

Feedback

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

Informal feedback on progress in labs/tutes

Graded assignments with comments