facebook
favorite button
member since icon
Since March 2025
Instructor since March 2025
Translated by GoogleSee original
Fundamentals of Algorithms and Programming in Python
course price icon
From 35 € /h
arrow icon
This course offers a progressive introduction to algorithmic thinking and Python programming. Through clear explanations, concrete examples, and practical exercises, learners will discover how to analyze a problem, design an efficient algorithm, and then translate it into Python code.
No prior programming experience is required: this course is aimed at beginners who are curious to learn to code by solving problems in a logical and structured way.
Location
location type icon
Online from France
About Me
My name is a computer engineer, passionate about teaching. Skilled in algorithms and Python, I am committed to sharing my knowledge in a clear and accessible manner. Having already trained several people, I have developed a real passion for teaching and I thrive on sharing knowledge. My goal is to make learning stimulating and practical for students.
Education
Computer Engineering Diploma, Private Higher School of Engineering and Telecommunications in Tunisia 2021
computer science baccalaureate in 2016
Experience / Qualifications
5 years of experience in IT, algorithm and python trainer
trainer in other IT fields
speaks 3 languages French English Arabic
Age
Children (7-12 years old)
Teenagers (13-17 years old)
Adults (18-64 years old)
Seniors (65+ years old)
Student level
Beginner
Intermediate
Advanced
Duration
60 minutes
90 minutes
120 minutes
The class is taught in
French
English
Arabic
Availability of a typical week
(GMT -04:00)
New York
at teacher icon
Online via webcam
Mon
Tue
Wed
Thu
Fri
Sat
Sun
00-04
04-08
08-12
12-16
16-20
20-24
Similar classes
arrow icon previousarrow icon next
verified badge
Vincent
With over seven years of experience in teaching Computer Science & Information Technology (ICT), I have developed a strong expertise in delivering high-quality education across multiple internationally recognized curricula, including Cambridge IGCSE, GCSE, A-Levels, O-Levels, and Checkpoint. My passion lies in equipping students with coding, cybersecurity, and digital literacy skills, ensuring they are well-prepared for the evolving demands of the digital world.

Expertise & Teaching Areas:
✅ Programming & Software Development: Python, Java, C++
✅ Cybersecurity: Ethical hacking, data protection, network security
✅ Digital Literacy: ICT applications, online safety, cloud computing
✅ Data Science & AI: Data analysis, machine learning fundamentals
✅ Web Development: HTML, CSS, JavaScript

Curriculum & Pedagogical Experience:
🔹 Cambridge IGCSE & GCSE ICT & Computer Science – Teaching core and extended syllabi, focusing on programming logic, databases, and networking.
🔹 Cambridge A-Levels & O-Levels Computer Science – Preparing students for advanced computing concepts, problem-solving, and algorithm development.
🔹 Cambridge Checkpoint ICT – Building foundational skills in digital technology and computer applications.

Professional Impact:
📌 Mentored students to achieve top grades in Cambridge ICT & Computer Science exams.
📌 Developed interactive lesson plans integrating real-world applications of technology.
📌 Conducted coding boot camps and cybersecurity workshops to enhance practical learning.
📌 Guided students in project-based learning, including app development and website design.

With a strong commitment to student-centered learning and technological innovation, I am dedicated to shaping future tech leaders and empowering learners with skills relevant to careers in technology, data science, and software development.
verified badge
Laroussi
Session 1: Revolutionizing your Scientific Writing with LaTeX & AI
Duration: 2 Hours | Level: Beginner | Tools: Overleaf + AI**

First Hour: Foundations and Cloud Environment (60 min)

1. Introduction to LaTeX Philosophy (15 min)

- The "WYSIWYM" concept:** Explain the difference between Word (*What You See Is What You Get*) and LaTeX (*What You See Is What You Mean*). Why content takes precedence over form.
- Key advantages:** Unrivaled typographic quality, automatic reference management, stability on long documents (theses), and free of charge.
- The structure of a file:** Distinction between the **preamble** (the brain: settings and packages) and the **body of the document** (the heart: text).

2. Immersion in Overleaf (25 min)

- Configuration:** Creation of an account and first project "Blank Project".
- Exploring the interface:** The file panel (left), the code editor (middle) and the PDF preview (right).
- Real-time collaboration:** How to share a project and leave comments (like on Google Docs).
- History and versions:** How to revert to a previous version in case of a compilation error.

3. Practical Workshop: My First Document (20 min)

* Writing basic commands: `\documentclass`, `\usepackage[french]{babel}`, `\title`, `\author`.
* Compilation of the document and observation of the result.
* Structuring: Use of `\section` and `\subsection`.

Second Hour: Mathematics and the Magic of AI (60 min)

4. The Power of Mathematics (20 min)

- Mathematical modes:** Difference between the text (`$...$`) and the centered block (`\[...\]`).
- Essential syntax:** Fractions `\frac{}{}`, exponents `^`, indices `_`, and roots `\sqrt{}`.
- Introduction to AMS packages: Why amsmath and amssymb are essential for professional rendering.

5. From hand to screen: AI at the service of LaTeX (30 min)

- Presentation of OCR tools:** Use of **Mathpix Snip** (the leader) or models like Gemini/ChatGPT to transform a photo into code.
- Concrete demonstration:
1. Take a picture of a complex handwritten formula (e.g., an integral with matrices).
2. Use AI to generate the corresponding LaTeX code.
3. Correction and insertion: Learn to check the AI-generated code before copying and pasting it into Overleaf.

6. Conclusion and Q&A (10 min)

* Summary of achievements.
* Resources for further exploration
* Definition of the exercise for the next session.
verified badge
عبدالرحمن
A comprehensive course in Linear Programming and Linear Optimization, based on the renowned reference:

Bertsimas, D., & Tsitsiklis, J. N. (1997). Introduction to Linear Optimization. Athena Scientific.

The course covers the first five chapters in their entirety, forming the foundation upon which everything that follows in mathematical improvement is built. The concepts are explained in clear Arabic with step-by-step solved examples, illustrations, and practice exercises.

The five lectures:

Lecture 1 — Introduction to Linear Optimization:

What is optimization? And why do we need it?

Variables, decisions, functions, and constraints

The general formula for linear programming

Standard Form

Reducing any issue to the standard formula

Piecewise Linear Convex Functions

Graphing and solution

Fundamentals of Linear Algebra

Analysis of algorithms and number of operations

Lecture 2 — Linear Programming Basics (LP Basics):

Practical examples: food issues, production, scheduling, networks, pattern classification

Converting problems to standard format

Remove free variables

Slack and Surplus variables

convex and concave functions

Absolute values in objective functions

Graphical solution in 2D and 3D

The five possible solutions

Lecture 3 — Geometry of Linear Programming (LP):

Polyhedron and Polytope

Hyperplanes & Halfspaces

Extreme Points

Vertices

Basic Feasible Solutions

Active Constraints

Degeneration

The presence of extreme points

Visual examples in 2D and 3D

Lecture 4 — The Simplex Method:

Optimality Conditions

Reduced Costs

Development of the Simplex algorithm

Simplex Tableau

Pivoting

The Revised Simplex Method

Cycling and how to avoid it

Bland's Rule

Finding a basic, possible, initial solution

Two-Phase Simplex Method

Big-M Method

Mathematical aptitude and average behavior

Klee-Minty cube

Lecture 5 — Duality Theory:

The original (Primal) and dual problem

The relationship between variables and constraints

Weak Duality Theory

Strong Duality Theory

Conditions for Complementary Slackness

Dual variables as marginal costs

Shadow Prices

Dual Simplex Method

Geometric interpretation of duality

Applications in Economics and Finance

Advantages:

🎯 Explanation based on an accredited academic reference

📐 Illustrations for each geometric concept

🧮 Solved examples with numbers

💻 Examples in Python using gurobipy

📊 Comparison tables between different formulas

🔗 Linking theory to practical applications

📝 Exercises at the end of each lecture
message icon
Contact Msr
repeat students icon
1st lesson is backed
by our
Good-fit Instructor Guarantee
Similar classes
arrow icon previousarrow icon next
verified badge
Vincent
With over seven years of experience in teaching Computer Science & Information Technology (ICT), I have developed a strong expertise in delivering high-quality education across multiple internationally recognized curricula, including Cambridge IGCSE, GCSE, A-Levels, O-Levels, and Checkpoint. My passion lies in equipping students with coding, cybersecurity, and digital literacy skills, ensuring they are well-prepared for the evolving demands of the digital world.

Expertise & Teaching Areas:
✅ Programming & Software Development: Python, Java, C++
✅ Cybersecurity: Ethical hacking, data protection, network security
✅ Digital Literacy: ICT applications, online safety, cloud computing
✅ Data Science & AI: Data analysis, machine learning fundamentals
✅ Web Development: HTML, CSS, JavaScript

Curriculum & Pedagogical Experience:
🔹 Cambridge IGCSE & GCSE ICT & Computer Science – Teaching core and extended syllabi, focusing on programming logic, databases, and networking.
🔹 Cambridge A-Levels & O-Levels Computer Science – Preparing students for advanced computing concepts, problem-solving, and algorithm development.
🔹 Cambridge Checkpoint ICT – Building foundational skills in digital technology and computer applications.

Professional Impact:
📌 Mentored students to achieve top grades in Cambridge ICT & Computer Science exams.
📌 Developed interactive lesson plans integrating real-world applications of technology.
📌 Conducted coding boot camps and cybersecurity workshops to enhance practical learning.
📌 Guided students in project-based learning, including app development and website design.

With a strong commitment to student-centered learning and technological innovation, I am dedicated to shaping future tech leaders and empowering learners with skills relevant to careers in technology, data science, and software development.
verified badge
Laroussi
Session 1: Revolutionizing your Scientific Writing with LaTeX & AI
Duration: 2 Hours | Level: Beginner | Tools: Overleaf + AI**

First Hour: Foundations and Cloud Environment (60 min)

1. Introduction to LaTeX Philosophy (15 min)

- The "WYSIWYM" concept:** Explain the difference between Word (*What You See Is What You Get*) and LaTeX (*What You See Is What You Mean*). Why content takes precedence over form.
- Key advantages:** Unrivaled typographic quality, automatic reference management, stability on long documents (theses), and free of charge.
- The structure of a file:** Distinction between the **preamble** (the brain: settings and packages) and the **body of the document** (the heart: text).

2. Immersion in Overleaf (25 min)

- Configuration:** Creation of an account and first project "Blank Project".
- Exploring the interface:** The file panel (left), the code editor (middle) and the PDF preview (right).
- Real-time collaboration:** How to share a project and leave comments (like on Google Docs).
- History and versions:** How to revert to a previous version in case of a compilation error.

3. Practical Workshop: My First Document (20 min)

* Writing basic commands: `\documentclass`, `\usepackage[french]{babel}`, `\title`, `\author`.
* Compilation of the document and observation of the result.
* Structuring: Use of `\section` and `\subsection`.

Second Hour: Mathematics and the Magic of AI (60 min)

4. The Power of Mathematics (20 min)

- Mathematical modes:** Difference between the text (`$...$`) and the centered block (`\[...\]`).
- Essential syntax:** Fractions `\frac{}{}`, exponents `^`, indices `_`, and roots `\sqrt{}`.
- Introduction to AMS packages: Why amsmath and amssymb are essential for professional rendering.

5. From hand to screen: AI at the service of LaTeX (30 min)

- Presentation of OCR tools:** Use of **Mathpix Snip** (the leader) or models like Gemini/ChatGPT to transform a photo into code.
- Concrete demonstration:
1. Take a picture of a complex handwritten formula (e.g., an integral with matrices).
2. Use AI to generate the corresponding LaTeX code.
3. Correction and insertion: Learn to check the AI-generated code before copying and pasting it into Overleaf.

6. Conclusion and Q&A (10 min)

* Summary of achievements.
* Resources for further exploration
* Definition of the exercise for the next session.
verified badge
عبدالرحمن
A comprehensive course in Linear Programming and Linear Optimization, based on the renowned reference:

Bertsimas, D., & Tsitsiklis, J. N. (1997). Introduction to Linear Optimization. Athena Scientific.

The course covers the first five chapters in their entirety, forming the foundation upon which everything that follows in mathematical improvement is built. The concepts are explained in clear Arabic with step-by-step solved examples, illustrations, and practice exercises.

The five lectures:

Lecture 1 — Introduction to Linear Optimization:

What is optimization? And why do we need it?

Variables, decisions, functions, and constraints

The general formula for linear programming

Standard Form

Reducing any issue to the standard formula

Piecewise Linear Convex Functions

Graphing and solution

Fundamentals of Linear Algebra

Analysis of algorithms and number of operations

Lecture 2 — Linear Programming Basics (LP Basics):

Practical examples: food issues, production, scheduling, networks, pattern classification

Converting problems to standard format

Remove free variables

Slack and Surplus variables

convex and concave functions

Absolute values in objective functions

Graphical solution in 2D and 3D

The five possible solutions

Lecture 3 — Geometry of Linear Programming (LP):

Polyhedron and Polytope

Hyperplanes & Halfspaces

Extreme Points

Vertices

Basic Feasible Solutions

Active Constraints

Degeneration

The presence of extreme points

Visual examples in 2D and 3D

Lecture 4 — The Simplex Method:

Optimality Conditions

Reduced Costs

Development of the Simplex algorithm

Simplex Tableau

Pivoting

The Revised Simplex Method

Cycling and how to avoid it

Bland's Rule

Finding a basic, possible, initial solution

Two-Phase Simplex Method

Big-M Method

Mathematical aptitude and average behavior

Klee-Minty cube

Lecture 5 — Duality Theory:

The original (Primal) and dual problem

The relationship between variables and constraints

Weak Duality Theory

Strong Duality Theory

Conditions for Complementary Slackness

Dual variables as marginal costs

Shadow Prices

Dual Simplex Method

Geometric interpretation of duality

Applications in Economics and Finance

Advantages:

🎯 Explanation based on an accredited academic reference

📐 Illustrations for each geometric concept

🧮 Solved examples with numbers

💻 Examples in Python using gurobipy

📊 Comparison tables between different formulas

🔗 Linking theory to practical applications

📝 Exercises at the end of each lecture
Good-fit Instructor Guarantee
favorite button
message icon
Contact Msr