Lec 02 Algorithms

Lec 02 Algorithms - FIT1002 Computer Programming 2010...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
FIT1002 Computer Programming 2010 Module 2 Algorithms www.monash.edu.au FIT1002 Computer Programming Semester 1, 2010 Module 2 Part 1 – Algorithms and Data COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University pursuant to Part VB of the Copyright Act 1968 (the Act). The material in this communication may be subject to copyright under the Act. Any further reproduction or communication of this material by you may be the subject of copyright protection under the Act. Do not remove this notice. The authors acknowledge that material in these modules has been adapted from slides produced by Lewis, DePasquale and Chase for Java Foundations: Introduction to Programming and Data Structures , Addison-Wesley, 2007 2 Assumed Knowledge • Before the beginning of this lecture, students should: – be familiar with the terms compiler , program , and machine code ; – have reviewed some simple Java programs from the Module 1 materials and Lewis et. al. Chapter 1 • Before the beginning of this lecture, students should have read over: > Chapter 2, sections 2.1 and 2.2 of Lewis et. al. 3 Algorithms: Objectives • Understand the role programming plays in the problem-solving process • Understand the concept of an algorithm, and the relationship between algorithms and programs • Be able to write basic algorithms for everyday tasks • To understand the purpose of variables • To understand the difference between variables and constants
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
FIT1002 Computer Programming 2010 Module 2 Algorithms 4 The Problem Solving Process 5 5 The Problem Solving Process is not linear! debugging & testing 6 algorithm | ± alg ə r ɪ ð( ə )m| noun a process or set of rules to be followed in calculations or other problem-solving operations, esp. by a computer. The term is named after Muhammad ibn Musa al- Khwarizmi of Khowarezm (now Khiva in Uzbekistan), Circa 780-850 C.E. Algoritmi is latinised al-Khwarizmi Algorithm
Background image of page 2
FIT1002 Computer Programming 2010 Module 2 Algorithms 7 A lgor ithm-Examp les A cooking recipe Assembly instructions for a model The rules of how to play a game • Instructions on how to operate a piece of equipment • Directions for driving from A to B A knitting pattern • A car repair manual 8 Algorithms An algorithm is a well-defined sequence of unambiguous instructions Should terminate (to produce a result) Algorithm description must be precise, using terms and language that will be understood exactly by whoever is going to read it. It may contain English text and mathematical expressions, provided these are used clearly and precisely. Example: Manual Addition… Describe the method to your friend. .. you have just recited an algorithm!
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/15/2010 for the course FIT 1002 taught by Professor Mylini during the Three '10 term at Monash.

Page1 / 19

Lec 02 Algorithms - FIT1002 Computer Programming 2010...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online