Full-Stack Developer
217 episodes · showing the newest 200
15 min
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...
15 min
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...
15 min
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...
15 min
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...
15 min
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 ...
15 min
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...
15 min
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...
15 min
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...
15 min
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...
15 min
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...
15 min
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...
15 min
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...
15 min
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, para...
15 min
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 ...
15 min
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...
15 min
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...
15 min
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...
15 min
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...
15 min
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 ...
15 min
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...
15 min
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. ...
15 min
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...
15 min
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' ...
15 min
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...
15 min
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...
15 min
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...
15 min
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...
15 min
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 / ...
15 min
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...
15 min
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...
15 min
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...
15 min
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...
15 min
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...
15 min
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, constants,...
15 min
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 ...
15 min
**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...
15 min
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...
15 min
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 ...
15 min
**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 ...
15 min
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...
15 min
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...
15 min
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...
15 min
THEORETICAL RECAP An algorithm is a finite, ordered sequence of unambiguous instructions designed to solve a specific problem or accomplish a well-defined task. Three foundational concepts underpin everything you have studied so far: sequence (instru...
15 min
THEORETICAL RECAP An algorithm is a finite, ordered sequence of unambiguous instructions designed to solve a specific problem. The key word here is 'ordered': each step must follow logically from the previous one, and every instruction must be clear ...
15 min
In the previous activities, you have learned what an algorithm is, how to write pseudo-code, how to represent execution flows using organization charts, and how sequencing works in a program. You have seen that an algorithm is essentially a precise s...
15 min
THEORETICAL RECAP An organization chart (or flowchart) is a visual representation of a process, algorithm, or decision logic. It translates the sequential, conditional, and repetitive structures of an algorithm into standardized graphic symbols. Each...
15 min
When you write a program, the computer does not read your instructions randomly or all at once. It follows a precise order, one step at a time, from the first instruction to the last. This fundamental behavior is called linear execution flow. Underst...
15 min
THEORETICAL RECAP An algorithm is a finite, ordered sequence of instructions designed to solve a problem or accomplish a task. Pseudo-code is the human-readable representation of an algorithm: it uses plain language combined with programming-like str...
15 min
**Theoretical Recap** An algorithm is a finite, ordered sequence of unambiguous instructions designed to solve a problem or accomplish a task. Pseudo-code is a way of describing an algorithm using plain, structured language — somewhere between natura...
15 min
Now that you understand what an algorithm is — a finite and ordered set of instructions designed to solve a problem — it is time to explore how to write one in a concrete and readable way before translating it into actual code. This is where pseudo-c...
Up next