Retour

Explorez tous les épisodes du podcast Full Stack Web Developer

Plongez dans la liste complète des épisodes de Full Stack Web Developer. Chaque épisode est catalogué accompagné de descriptions détaillées, ce qui facilite la recherche et l'exploration de sujets spécifiques. Suivez tous les épisodes de votre podcast préféré et ne manquez aucun contenu pertinent.

Rows per page:

1–50 of 175

TitreDateDurée
Developer perspective: beginner best practices11 sept. 202600:15:00
Now that you have written your first functions, handled variables, applied conditions, and connected simple browser events, it is time to step back and adopt the mindset of a professional developer. Writing code that works is only half the job. Writi...
Summary review: write a readable and commented script10 sept. 202600:15:00
Writing a script that works is only half the job. Writing a script that another developer, or your future self, can read, understand, and modify quickly is what separates a beginner from a professional. This summary review consolidates everything you...
Workshop: alert button with event handler09 sept. 202600:15:00
THEORETICAL RECAP An event is a signal the browser emits when something happens: a click, a key press, a page load. In JavaScript, you react to events by attaching an event handler (a function that runs when the event fires). The standard modern appr...
Introduction to browser events (overview)09 sept. 202600:15:00
Until now, you have written JavaScript that runs from top to bottom, executing every instruction in order the moment the page loads. But real web applications are not static. They must react to what the user does: a click on a button, a key pressed o...
Workshop: Click counter (prompt)08 sept. 202600:15:00
THEORETICAL RECAP Before starting the DOM, you will build a click counter using the browser's prompt() and alert() functions. A counter is simply a variable that stores a number and changes over time. The mental model is straightforward: you declare ...
Simplified scope and hoisting07 sept. 202600:15:00
Scope and hoisting are two fundamental concepts in JavaScript that explain where your variables and functions are accessible, and how JavaScript prepares them before running your code. Understanding these ideas will help you avoid many confusing bugs...
Workshop: refactored calculator with functions07 sept. 202600:15:00
THEORETICAL RECAP A function is a reusable block of code that takes input (parameters), performs a task, and usually returns a value with the 'return' keyword. In ES6, you can declare functions in several ways: the classic declaration 'function add(a...
Workshop: personalized greeting function04 sept. 202600:15:00
THEORETICAL RECAP A function in JavaScript is a reusable block of code that performs a task and, optionally, returns a value. In ES6, you can declare functions with the classic 'function' keyword or with arrow function syntax. A function usually take...
ES6 functions and arrow functions03 sept. 202600:15:00
Functions are one of the most important building blocks in JavaScript. A function is a reusable block of code that performs a specific task. Until now, you have worked with variables, operators, and conditions. Functions allow you to group these inst...
Workshop: Even or odd?02 sept. 202600:15:00
THEORETICAL RECAP Determining whether a number is even or odd relies on the modulo operator (%), which returns the remainder of a division. A number is even when dividing it by 2 leaves no remainder, meaning n % 2 === 0. Otherwise, the remainder is 1...
Workshop: legal majority — interactive script01 sept. 202600:15:00
THEORETICAL RECAP In JavaScript ES6+, a program often needs to react to information provided at runtime. You have already seen variables (let, const), primitive types (number, string, boolean), type conversions, arithmetic operators, template literal...
If/else conditions and comparison operators01 sept. 202600:15:00
Until now, you have written programs that execute every line from top to bottom, without ever making a choice. But real applications constantly need to make decisions: show a welcome message only if a user is logged in, allow a purchase only if the a...
Workshop: mini calculator in console31 août 202600:15:00
THEORETICAL RECAP Before starting, let's consolidate what you already know. In JavaScript ES6, you declare variables with `let` (reassignable) and `const` (fixed reference). Primitive types include numbers, strings, and booleans. A crucial point for ...
Arithmetic operators and template literals31 août 202600:15:00
In the previous activities you learned how to declare variables using let and const, and you explored the primitive types of JavaScript such as numbers and strings. You also practiced simple type conversions. This chapter builds directly on that foun...
Workshop: Simple type conversions28 août 202600:15:00
THEORETICAL RECAP In JavaScript, every value has a type: string, number, boolean, undefined, null, and others. Type conversion (or type casting) means transforming a value from one type into another. There are two kinds. Explicit conversion is when y...
Workshop: declaring and displaying variables27 août 202600:15:00
THEORETICAL RECAP In JavaScript ES6+, you declare variables mainly with two keywords: 'let' and 'const'. Use 'const' when a value must not be reassigned after its initial assignment, and 'let' when the value may change over time. Avoid the older 'var...
ES6 variables (let, const) and primitive types27 août 202600:15:00
JavaScript is the programming language that brings interactivity to web pages. Before writing any logic, you must understand how to store and manipulate data. This is the role of variables and primitive types. This chapter covers the modern way to de...
Welcome and chapter goals26 août 202600:15:00
Welcome to the chapter dedicated to JavaScript ES6+ basics and manipulation of the Document Object Model. This chapter is a decisive step in your journey to becoming a Full Stack Web Developer. Until now, you have discovered how to structure web page...
Assessment and transition to JavaScript implementation26 août 202600:15:00
This chapter closes the foundational section on algorithmics and programming logic. Its purpose is twofold: to assess and consolidate everything you have learned so far (variables, conditions, loops, functions, lists, and time complexity), and to pre...
Introduction to O (n) time complexity25 août 202600:15:00
When you write code, you want it to produce the correct result. But producing the correct result is not enough for a professional developer. You also need your code to run efficiently, especially when it processes large amounts of data. This is where...
Cash register - summary of concepts24 août 202600:15:00
## Project overview You will build a command-line cash register program that simulates a real point-of-sale checkout. This mini-project consolidates every core concept you have practiced in the Algorithmics and programming logic chapter: functions, p...
Find the minimum in a list24 août 202600:15:00
THEORETICAL RECAP Finding the minimum in a list is a fundamental algorithmic pattern you will reuse constantly. The idea is simple: you traverse a list of values once, keeping track of the smallest value seen so far. The correct mental model is that ...
Browse a list and view items21 août 202600:15:00
THEORETICAL RECAP A list (also called an array or table) is an ordered collection of values stored under a single name, where each element occupies a position identified by an index. In most programming languages, indexing starts at 0: the first elem...
Lists/Tables - store multiple values20 août 202600:15:00
Until now, you have worked with variables that store a single value at a time: a number, a text string, or a boolean. But real programs often need to handle many values at once. Imagine you want to store the names of thirty students, the prices of on...
Algorithm documentation and comments20 août 202600:15:00
Documentation and comments are two closely related practices that make your code understandable, maintainable, and reusable by yourself and by others. After learning to write loops, conditions, and functions, you now need to learn how to explain what...
Refactor Factorial based19 août 202600:15:00
THEORETICAL RECAP A factorial of a non-negative integer n (written n!) is the product of all positive integers from 1 up to n, with the special rule that 0! equals 1. In programming, the factorial is the classic example used to compare two approaches...
Passage of parameters and scope of variables18 août 202600:15:00
In the previous chapters, you learned to create functions and procedures to organize your code into reusable blocks. Now we go deeper into two fundamental concepts that determine how functions communicate with the rest of the program: the passage of ...
Create a sum function17 août 202600:15:00
THEORETICAL RECAP A function is a reusable block of code that takes zero or more inputs (called parameters or arguments), performs a task, and often returns a result. The mental model to keep in mind is that of a machine: you feed it raw material (th...
Modularity: functions and procedures17 août 202600:15:00
Until now, you have written instructions in a single continuous block: conditions, loops, calculations, all following one another from top to bottom. This works for small exercises, but as soon as a program grows, this approach becomes unmanageable. ...
Multiplication table14 août 202600:15:00
THEORETICAL RECAP A loop repeats a block of instructions until a condition is met. You have already worked with 'while' loops (repeat as long as a condition is true) and 'for' loops (repeat a known number of times, with a counter). The mental model t...
Nested loops and basic optimization13 août 202600:15:00
Nested loops are one of the most powerful tools in programming, but also one of the most dangerous in terms of performance. A nested loop is simply a loop placed inside another loop. You already know how to write a single loop (the 'while' and 'for' ...
For - Calculate a factorial13 août 202600:15:00
THEORETICAL RECAP A factorial of a non-negative integer N, written N!, is the product of all positive integers from 1 up to N. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120. By convention, 0! = 1. This is a perfect problem for the 'for' loop, because you...
Common loop patterns12 août 202600:15:00
Loops let you repeat instructions. But repetition alone is not enough: what matters is what you do during each repetition. Over time, programmers noticed that the same structures come back again and again. These are called loop patterns. Learning the...
While - Count from 1 to N11 août 202600:15:00
THEORETICAL RECAP A 'while' loop repeats a block of instructions as long as a condition remains true. Its structure is simple: you define a starting point (an initialization), a condition that is tested before each iteration, and an update inside the...
While and For loops - repetition principle11 août 202600:15:00
In programming, one of the most powerful ideas is the ability to repeat instructions automatically. So far, you have learned how to store data in variables, run instructions in sequence, and make decisions using conditions with IF, AND, OR. Loops add...
Mini-project - Calculating the price of a train ticket10 août 202600:15:00
THEORETICAL RECAP A program is a sequence of instructions executed in order. To build useful logic, you combine three foundations you have already studied: variables (containers that store data such as numbers, strings or booleans), conditions (IF / ...
Combine conditions (AND/OR)07 août 202600:15:00
Until now, you have learned to write a single condition inside an IF test, using comparison operators such as greater than, less than, or equal to. But in real programs, a single condition is often not enough. You frequently need to check several thi...
Reduced price choice07 août 202600:15:00
THEORETICAL RECAP A conditional structure lets a program make decisions. The core mental model is simple: 'IF a condition is true, THEN execute this block; OTHERWISE execute another block.' A condition is a boolean expression that evaluates to either...
Comparison operators and boolean06 août 202600:15:00
Comparison operators and boolean values are at the heart of every decision your programs will ever make. In the previous chapters, you learned how to store data in variables, perform calculations, and write your first simple conditional test with the...
Writing a simple IF test05 août 202600:15:00
THEORETICAL RECAP A conditional test (the IF statement) allows a program to make decisions. Instead of executing instructions in a strict linear order, the program evaluates a condition — a boolean expression that is either TRUE or FALSE — and only r...
Introduction to logical conditions and operators05 août 202600:15:00
Until now, the programs you have written run in a straight line: each instruction executes one after the other, always in the same order. This is called a sequence. But a real program needs to make decisions. It must be able to react differently depe...
Checkpoint ramp - Simple shopping cart management04 août 202600:15:00
## Project Overview This mini-project is a skills validation checkpoint designed to consolidate everything you have learned so far in the 'Algorithmics and programming logic' chapter. Building directly on your work with variables, data types, constan...
mini-project - BMI calculation03 août 202600:15:00
THEORETICAL RECAP Before diving into this workshop, let's consolidate what you have learned so far. A variable is a named storage location in memory that holds a value which can change during program execution. A constant, by contrast, holds a fixed ...
Simple calculations with variables31 juil. 202600:15:00
**Theoretical Recap** A variable is a named memory slot used to store a value that can change during program execution. It has three key attributes: a name (identifier), a type (integer, real, string, boolean), and a value. When you perform calculati...
Naming constants and conventions31 juil. 202600:15:00
In the previous activities, you learned how to declare and assign variables, work with common data types, and write basic arithmetic expressions. You now have a solid foundation for understanding how data is stored and manipulated in an algorithm. In...
Common data types (integer, real, string, boolean)30 juil. 202600:15:00
Every piece of information that a program manipulates must have a type. A data type tells the computer what kind of value is being stored and what operations can be performed on it. Without this concept, a program would not know whether the value 42 ...
Exchange two values29 juil. 202600:15:00
**Theoretical Recap** A variable is a named container that holds a value at a given moment in a program's execution. You have already practiced declaring and assigning variables, as well as performing basic arithmetic expressions. Now, a classic and ...
Declare and assign variables28 juil. 202600:15:00
THEORETICAL RECAP A variable is a named container that stores a value in memory during the execution of a program. Think of it as a labeled box: you give it a name, you put something inside, and you can open it, read its content, or replace it at any...
Basic arithmetic expressions28 juil. 202600:15:00
In the previous activities, you have explored the fundamentals of algorithms: sequencing, execution flow, pseudocode, variables, and states. You now know how to structure a logical process step by step and store information in variables. The next nat...
Introduction to variables and status27 juil. 202600:15:00
Now that you have a solid understanding of sequencing, execution flow, pseudo-code, and best practices for writing clean algorithms, it is time to take a crucial step forward: understanding variables and the concept of state. These two notions are at...
© My Podcast Data · Projet indépendant · Données issues d'Apple & Spotify
À proposMéthodologieContactMe soutenirPolitique de confidentialitéMentions légales