Session 4

Properties of algorithms

Presentation and objectifs

You are certainly not the first developer to face your current problem. It certainly means that several solutions to solve it have already been envisaged. How to compare them and to select the most appropriate one? This is the central question addressed in session 5. In addition, you will learn how to write tests and document your code to ensure its reusability.

Algorithmics

On the algorithmics part, you will acquire theoretical and technical skills to judge the adequacy between a problem and a possible algorithmic solutions. To do so, you will study:

• theoretical algorithmic properties (specification, termination, deterministic/stochastic),

Before the class

For the algorithmic part, to prepare for this course, you need to understand how to design binary search tree, and dynamic programming.

Technical requirements

To prepare the labs, make sure you have the following tools installed on your computer:

• a recent version of the Python interpreter installed,
• the VSCode IDE and the following extension.

For this lab, we advise you to deactivate Gihub Copilot.

Course contents

• Algorithmic complexity.

Once the algorithmic concepts manipulated in this session managed, move to the following exercices during the supervised activity:

• exercices on BST and dynamic programming

After the class

• Review the course contents seen during this activity.
• Make sure you complete the practical session before the next activity.
• Make sure you complete essential exercises.
• Prepare the session.