Algorithmics

CT065-3.5-3

Introduction

Level 3 – Computing (Software Engineering)

 Learning Outcomes

• Need and importance of pseudocode.

• Conventions used in a pseudocode.
• Importance of algorithms in solving problems.

Module Code and Module Title Title of Slides Slide 3 (of 11)
 What is expected of you

• Punctual and regular attendance

• Participation in class

• Enthusiastic involvement in group work

Module Code and Module Title Title of Slides Slide 6 (of 11)
 Available Resources

• Consultation hours

• Library and Internet Resources

Module Code and Module Title Title of Slides Slide 7 (of 11)
 Recommended Texts

• Data Structures and Algorithms in Java 3rd

Edition, M T Goodrich, R Tamassia, WILEY
2004, ISBN: 0471-46983-1
• Computer Algorithms Introduction to Design &
Analysis, S Baase, A V Gelder, ADDISON,
WESLEY 2000, ISBN: 0201612445
• Fundamentals of Algorithmics, G Brassard, P
Bratley, PRENTICE-HALL 1996, ISBN:0-13-
335068-1
• Introduction to Graph Theory 2nd Edition, D B
West, PEARSON HIGHER EDUCATION 2000,
ISBN: 0-13-0144400-2

Module Code and Module Title Title of Slides Slide 8 (of 11)
 Assessment

• Exam Paper (100%)

– One Section: (5 Questions, 4 Attempted)

Module Code and Module Title Title of Slides Slide 9 (of 11)
 Algorithm
• An algorithm is a finite sequence of step
by step, discrete, unambiguous
instructions for solving a particular
problem

– has input data, and is expected to produce

output data
– each instruction can be carried out in a finite
amount of time in a deterministic way
Module Code and Module Title Title of Slides
 Definition

• We deal with data processing problems

• translated to programs that can be run on
a computer
• Since we can only input, store, process &
output data on a computer, the instructions
in our algorithms will be limited to these
functions

Module Code and Module Title Title of Slides

 Definition

• In simple terms, an algorithm is a series of

instructions to solve a problem (complete a task)

• Problems can be in any form

– Business
• Get a part from Vancouver to Ottawa by morning
• Allocate manpower to maximize profit
– Life
• I am hungry. How do I order pizza?
• Explain how to tie shoelaces to a five year old child

Module Code and Module Title Title of Slides

 Algorithmic Representation of
Computer Functions
• Input
– Get information Get (input command)
• Storage
– Store information Given/Result
Intermediates/Set
• Process
– Arithmetic Let (assignment command)
– Repeat instructions Loop
– Branch conditionals If
• Output
– Give information Give (output command)

Module Code and Module Title Title of Slides

 Algorithm Description
• Understand the problem before solving
it
– Identify & name each Input/Givens
– Identify & name each Output/Results
– Assign a name to our algorithm (Name)
– Combine the previous 3 pieces of
information into a formal statement
(Definition)
• Results := Name (Givens)

Module Code and Module Title Title of Slides

 Q&A

Any Questions?

Module Code and Module Title Title of Slides Slide 10 (of 11)
 Summary

• Introduction to algorithms
• Definition of algorithm
• Application of algorithms

Module Code and Module Title Title of Slides

 Next Session

• Introduction to pseudocode
• Sample pseudocode programs
• Classification and categorisation of
algorithms
– Data structure
– Design
– Field of study

Module Code and Module Title Title of Slides Slide 11 (of 11)