fr
en
Design and implement algorithms
Application requirements need to become understandable, maintainable code. Structure your development approach and connect technical decisions to the expected behaviour. Build the independence to design, verify and evolve your applications.
- Duration
- 3 days 21 hours
- Code
- ALGO-CF-FR Code
Presentation
Algorithms are used throughout programming, from social networks and search engines to financial services and software. They play a crucial role in designing and developing computer programs, advancing technology and improving service efficiency across many fields.
If you want to become a developer, it is important to learn about algorithms before you start coding. They underpin computing and programming. An algorithm is a step-by-step procedure for solving a problem or completing a task.
Although algorithms solve many kinds of problems, this course treats them as a stepping stone to conventional programming. Understanding how they work before coding helps you become a better programmer, strengthen problem-solving skills and broaden career prospects.
Objectives
During this introduction to algorithms course, you will learn to:
- explore and apply basic programming principles through algorithms;
- identify elements common to all computer programming languages;
- apply appropriate structural logic when writing code;
- use a structured problem-solving approach independent of hardware or software constraints;
- solve problems of varying difficulty and translate them into programming language;
- process structured data;
- analyse and evaluate algorithm complexity.
Program
Introduction
- What is an algorithm?
- General principles of computers.
- Algorithms in programming.
Overview of algorithms
- Algorithm structure.
- Algorithm description language.
- Inputs and outputs.
- Practical workshop: design your first algorithm.
Using variables
- What is a variable?
- Defining and declaring variables.
- Variable assignment.
- Practical workshop: design an algorithm and manage variables.
Using operators
- Arithmetic operators.
- Simple and compound conditions.
- Boolean operators.
- Practical workshop: design an algorithm using operators.
Using control structures
- Alternative or conditional structures.
- Iterative or repetitive structures.
- Sequential or linear structures.
- Breaks in sequence.
- Practical workshop: design an algorithm for a higher-or-lower guessing game.
Using arrays and indexed variables
- Declaration, initialisation and memory allocation.
- Multidimensional arrays.
- Linear data structures: lists, stacks and queues.
- Practical workshop: design an array manipulation algorithm.
Sorting arrays
- Selection sort.
- Bubble sort.
- Binary search.
- Practical workshop: design a bubble sort algorithm for an array.
Using functions and procedures
- Structured top-down design.
- Recursive subroutines.
- Syntax and the return statement.
- Practical workshop: design a recursive algorithm.
Optimising an algorithm
- Asymptotic measurement.
- Types of notation.
- Time and space complexity.
- Practical workshop: evaluate the complexity of a given algorithm.
Audience
This course is intended for:
- anyone wishing to become familiar with computer programming and coding.
Prerequisites
The introduction to algorithms course has no prerequisites.
Teaching and assessment methods
- Initial skills assessment
- Training materials provided to participants
- Continuous assessment throughout the course
- End-of-course feedback questionnaire
- Combination of theory and practical application
- Attendance records
- Post-course follow-up evaluation
- Practical exercises
Course highlights
Dates and sessions
Choose the date and delivery format that suit you.
No upcoming sessions are currently available.