Add multilingual language and systems learning tracks

en/basic-practice-20261101/README.md

@@ -0,0 +1,9 @@
+# BASIC — build and test
+
+[Agila University track](https://edu.agilaos.com/track.php?track=21&lang=en)
+
+About 15 minutes per lesson. Predict, run, change, explain, then complete the check in University.
+
+- [Lesson 1: Collections and repeated work](lesson-1/lesson.html)
+- [Lesson 2: A language feature worth understanding](lesson-2/lesson.html)
+- [Lesson 3: Build, break, and test a study planner](lesson-3/lesson.html)

en/basic-practice-20261101/lesson-1/lesson.html

@@ -0,0 +1,11 @@
+<!doctype html><html lang="en"><meta charset="utf-8"><title>Collections and repeated work</title><h1>Collections and repeated work</h1><p>15-minute session: read for 3 minutes, trace for 3, experiment for 7, and complete the check for 2. Spend longer whenever you need.</p><p>A collection stores related values. The loop visits 1, 2, and 3, updating the total from 0 to 1, then 3, then 6. Record this trace rather than guessing. Identify the first and last valid positions in this language: Pascal can declare a 1-based array, while many other examples use zero-based containers. Add another value and update the bounds correctly. Explain what an empty collection should produce.</p><p>Line numbers describe program order. <code>GOSUB</code> visits a subroutine and <code>RETURN</code> resumes the caller. <code>SYSTEM</code> exits this interpreter. BASIC dialects differ: a 6502 or Z80 computer does not automatically run this exact dialect.</p><pre><code class="language-basic">10 DIM M(3)
+20 LET M(1)=1
+30 LET M(2)=2
+40 LET M(3)=3
+50 LET T=0
+60 FOR I=1 TO 3
+70 LET T=T+M(I)
+80 NEXT I
+90 PRINT T
+100 SYSTEM
+</code></pre><p><strong>Expected result:</strong> <code>6</code></p><h3>Practice and evidence</h3><p>Keep three notes: your prediction, the actual result, and why they match or differ. The completion check grades understanding; the practice task builds skill.</p><p><a href="https://packages.ubuntu.com/noble/bwbasic">Language reference</a></p></html>

en/basic-practice-20261101/lesson-1/main.bas

@@ -0,0 +1,10 @@
+10 DIM M(3)
+20 LET M(1)=1
+30 LET M(2)=2
+40 LET M(3)=3
+50 LET T=0
+60 FOR I=1 TO 3
+70 LET T=T+M(I)
+80 NEXT I
+90 PRINT T
+100 SYSTEM

en/basic-practice-20261101/lesson-2/lesson.html

@@ -0,0 +1,6 @@
+<!doctype html><html lang="en"><meta charset="utf-8"><title>A language feature worth understanding</title><h1>A language feature worth understanding</h1><p>15-minute session: read for 3 minutes, trace for 3, experiment for 7, and complete the check for 2. Spend longer whenever you need.</p><p>Use the language note below to explain this example’s state changes. Identify what is copied, what is shared, what can fail, and what is released. Only some of those questions apply to this particular program: say which ones. Make one deliberate change, predict the effect, and compare it with the actual result. A familiar-looking operator in another language may obey a different rule.</p><p>Line numbers describe program order. <code>GOSUB</code> visits a subroutine and <code>RETURN</code> resumes the caller. <code>SYSTEM</code> exits this interpreter. BASIC dialects differ: a 6502 or Z80 computer does not automatically run this exact dialect.</p><p>The MOD expression deliberately models an unsigned 8-bit wrap: 255 + 1 becomes 0 modulo 256. It does not change the BASIC interpreter’s numeric representation or emulate a 6502 CPU.</p><pre><code class="language-basic">10 REM An 8-bit unsigned wrap is modeled explicitly
+20 LET VALUE=255
+30 LET WRAPPED=(VALUE+1) MOD 256
+40 PRINT WRAPPED
+50 SYSTEM
+</code></pre><p><strong>Expected result:</strong> <code>0</code></p><h3>Practice and evidence</h3><p>Keep three notes: your prediction, the actual result, and why they match or differ. The completion check grades understanding; the practice task builds skill.</p><p><a href="https://packages.ubuntu.com/noble/bwbasic">Language reference</a></p></html>

en/basic-practice-20261101/lesson-2/main.bas

@@ -0,0 +1,5 @@
+10 REM An 8-bit unsigned wrap is modeled explicitly
+20 LET VALUE=255
+30 LET WRAPPED=(VALUE+1) MOD 256
+40 PRINT WRAPPED
+50 SYSTEM

en/basic-practice-20261101/lesson-3/lesson.html

@@ -0,0 +1,10 @@
+<!doctype html><html lang="en"><meta charset="utf-8"><title>Build, break, and test a study planner</title><h1>Build, break, and test a study planner</h1><p>15-minute session: read for 3 minutes, trace for 3, experiment for 7, and complete the check for 2. Spend longer whenever you need.</p><p>A useful test compares a result with a requirement. The planner must never report negative remaining work for its stated nonnegative input domain. Run the starter, then deliberately remove the protection for completed counts above total. At least one check should fail. Restore it. Add two named study tasks, a summary, and boundary cases. Save the source and evidence on Agila Forge. Explain every line, including anything suggested by AI.</p><p>Line numbers describe program order. <code>GOSUB</code> visits a subroutine and <code>RETURN</code> resumes the caller. <code>SYSTEM</code> exits this interpreter. BASIC dialects differ: a 6502 or Z80 computer does not automatically run this exact dialect.</p><pre><code class="language-basic">10 LET T=4
+20 LET D=5
+30 GOSUB 200
+40 IF R&lt;&gt;0 THEN PRINT &quot;Test failed&quot;
+50 IF R=0 THEN PRINT &quot;Passed&quot;
+60 SYSTEM
+200 LET R=T-D
+210 IF R&lt;0 THEN LET R=0
+220 RETURN
+</code></pre><p><strong>Expected result:</strong> <code>Passed</code></p><h3>Practice and evidence</h3><p>Keep three notes: your prediction, the actual result, and why they match or differ. The completion check grades understanding; the practice task builds skill.</p><p><a href="https://packages.ubuntu.com/noble/bwbasic">Language reference</a></p></html>

en/basic-practice-20261101/lesson-3/main.bas

@@ -0,0 +1,9 @@
+10 LET T=4
+20 LET D=5
+30 GOSUB 200
+40 IF R<>0 THEN PRINT "Test failed"
+50 IF R=0 THEN PRINT "Passed"
+60 SYSTEM
+200 LET R=T-D
+210 IF R<0 THEN LET R=0
+220 RETURN