A practical guide to learning with the Nodeledge platform.
Nodeledge is a learning platform for technical subjects, starting with the mathematics and Python that machine learning is built on. It is built on a few ideas from learning science that have held up across many studies: you only move on once you've mastered what a topic depends on, you learn by working problems rather than by watching, and you come back to what you've learned just before you'd forget it.
01 · The knowledge graph
Every lesson in Nodeledge is a node in a knowledge graph, and every edge records that one topic is a prerequisite of another. When you choose a goal - one of our learning paths, or topics you pick yourself - Nodeledge works out every prerequisite you need and orders your lessons so that you never meet a topic before the ones it builds on.
Your goal is the node at the top. Nodeledge finds every topic it depends on, level by level: maths, Python and machine learning.
Why it works this way
02 · Skipping what you know
Every learning path comes with an optional diagnostic test. It finds your knowledge frontier and starts you there, wherever that is. For some people that's lesson one, and that's fine. For someone who already knows part of the subject, starting at lesson one means sitting through things they can do, and starting too far ahead means building on things they can't, so they stall. The frontier is the only place that's both efficient and effective.
A short diagnostic test, then the report of which topics you've already mastered.
Why it works this way
03 · One step at a time
Every lesson is a few small steps, and every step runs the same loop: explain, show, attempt, feedback. You pass the lesson by passing every step.
Feedback
The full solution, right or wrong
Explain
One idea, explained briefly
Attempt
Questions you answer yourself
Show
A worked example, solved line by line
Explain
One idea, explained briefly
Show
A worked example, solved line by line
Attempt
Questions you answer yourself
Feedback
The full solution, right or wrong
Questions:
3 correct
3 required
1 left
Level curves
To picture a surface we have so far cut it with vertical planes, holding one of the inputs, or , fixed. A horizontal plane also cuts it: the plane meets the surface wherever the height is exactly , and directly beneath that intersection, in the -plane, lies a curve.
Definition
The level curve of at level is the set of points of the -plane with .
Level curves at several levels, drawn together in the -plane and each labelled with its level, form the contour plot of . Each labelled curve on the plot is a contour.
Toggle the views below. The first view shows three horizontal planes cutting one surface, each intersection drawn again in the -plane beneath it. The second view shows those same curves on their own in the -plane, each labelled with its level.
Finding the level curve at level therefore means solving the single equation .
If no pair satisfies , then has no level curve at that level and nothing is drawn for it.
Details
The surface is cut by the horizontal planes and . Find the level curve of at each level, and describe what it looks like in the -plane.
Solution
The level curve at level is the set of points with , so at level we solve
This equation is the level curve: the curve consists of exactly the pairs satisfying it. To see what it looks like, we match it against a form we know: is the circle of radius about the origin, and here , so the level curve at is the circle of radius . Checking one of its points, , the level we set.
At level the equation is
Matching the form now asks for , and no real radius has a negative square. Nor does any point satisfy the equation, since is a sum of two squares and is never negative. There is no level curve at , and nothing is drawn for that level.
Which of these points lies on the level curve of at level ?
From the lesson Level curves and contour plots.
Why it works this way
04 · Keeping what you learn
You have forgotten more than you know. Everything you learn starts fading the moment you stop using it, and most courses make that your problem. Nodeledge treats forgetting as part of the job. Once you've passed a lesson, it comes back for review before it fades: after a few days at first, then further apart each time you pass, up to six months. We use a bespoke implementation of spaced repetition built on the knowledge graph: reviewing an advanced topic also counts, in part, as practice of the topics it depends on, so you keep hundreds of topics fresh with a few reviews a day.
The green topic is reviewed. The blue topics it depends on get credit too, weighted by how much the review exercised each one, and their next reviews move further out.
Why it works this way
05 · When you're stuck
Everyone gets stuck. In most courses that's the normal state: you bang your head against the wall until you're over it, or you give up. It shouldn't be like that here. You only meet a lesson when you've mastered everything it builds on, and every step is small, so most lessons pass first time and progress should feel smooth. When it doesn't, there are a few ways to be stuck, and each one has an answer. In every case the aim is the same: find the gap and fix it before anything gets built on it.
Why you get stuck on maths
Knowledge is hierarchical. Every concept loads on the ones below - and gaps at the base compromise everything above them.
Gaps at the base compromise everything above them.
Solid
Compromised
Missing
Three missing topics at the bottom put every topic built on them at risk. Fill them in and the whole tree holds.
Why it works this way
06 · Seeing your progress
Your dashboard shows what you've mastered, what's due for review and what comes next, and the knowledge graph behind it fills in as you go. You earn XP for questions you get right, and your streak counts the days you show up. If you're preparing for the PCEP Python certification, practice questions target your weakest areas and timed mock exams tell you when you're ready.
167
XP earned
Streak
30
This week
20 XP
42
43
45
23
6 to go
14
Mon
Tue
Wed
Thu
Fri
Sat
Sun
Days studied
5
Max streak
36
Total XP
11,687
The XP card from the learner dashboard, with a demo learner's year of study. It's live: switch between week and months, step back through the year, and hover over a day.
Why it works this way
07 · Further reading
The papers cited on this page. For an overview, start with Dunlosky et al. (2013), which rates practice testing and spaced practice as the only two of the ten techniques it reviewed with high utility.
Three subjects. Hundreds of lessons live today. Your subscription covers everything.
3 learning paths · 120 lessons
3 learning paths depending on your goal - Python Done Right, Essential Python for Data Science and ML, Python Essentials (PCEP). All mastery-based.
3 of 4 learning paths live · 279 lessons
Mathematical Foundations for ML, Essential Linear Algebra for ML, Essential Calculus for ML, Essential Probability & Statistics for ML. From high school to ML-ready.
Coming Late 2026
From linear regression to neural networks. The algorithms, not just the API calls.