praxis.ibLog in
IB Computer Science · first assessment 2027

Interactive lessons

One lesson per syllabus understanding, each ending with exam-style questions and a markscheme. Every unit has one free lesson.

Lessons
112
Unit tests
25

Theme AConcepts of computer science

A4Machine learning

A4.1Machine learning fundamentals2 lessons· Unit test
  1. A4.1.1Types of machine learning and their applications in the real worldFree
  2. A4.1.2Hardware requirements for various machine learning scenariosPremium
  3. Unit testPremium
A4.2Data preprocessing3 lessons· Unit testHL
  1. A4.2.1Significance of data cleaningFree
  2. A4.2.2Role of feature selectionPremium
  3. A4.2.3Importance of dimensionality reductionPremium
  4. Unit testPremium
A4.3Machine learning approaches10 lessons· Unit testHL
  1. A4.3.1Linear regression for predicting continuous outcomesFree
  2. A4.3.2Classification techniques in supervised learningPremium
  3. A4.3.3Role of hyperparameter tuning when evaluating supervised learning algorithmsPremium
  4. A4.3.4Clustering techniques in unsupervised learningPremium
  5. A4.3.5Association rule learning techniquesPremium
  6. A4.3.6How an agent learns to make decisions by interacting with its environment in reinforcement learningPremium
  7. A4.3.7Application of genetic algorithms in various real-world situationsPremium
  8. A4.3.8Structure and function of ANNs and multi-layer networksPremium
  9. A4.3.9How CNNs are designed to adaptively learn spatial hierarchies of features in imagesPremium
  10. A4.3.10Importance of model selection and comparison in machine learningPremium
  11. Unit testPremium
A4.4Ethical considerations2 lessons· Unit test
  1. A4.4.1Ethical implications of machine learning in real-world scenariosFree
  2. A4.4.2Ethical aspects of the increasing integration of computer technologies into daily lifePremium
  3. Unit testPremium

Theme BComputational thinking and problem-solving

B2Programming

B2.1Programming fundamentals4 lessons· Unit test
  1. B2.1.1Construct and trace programs using a range of global and local variables of various data typesFree
  2. B2.1.2Construct programs that can extract and manipulate substringsPremium
  3. B2.1.3How programs use common exception handling techniquesPremium
  4. B2.1.4Construct and use common debugging techniquesPremium
  5. Unit testPremium
B2.2Data structures4 lessons· Unit test
  1. B2.2.1Compare static and dynamic data structuresFree
  2. B2.2.2Construct programs that apply arrays and listsPremium
  3. B2.2.3Stack as a 'last in, first out' (LIFO) data structurePremium
  4. B2.2.4Queue as a 'first in, first out' (FIFO) data structurePremium
  5. Unit testPremium
B2.3Programming constructs4 lessons· Unit test
  1. B2.3.1Correct sequence of code instructionsFree
  2. B2.3.2Selection structuresPremium
  3. B2.3.3Looping structures for repeated actionsPremium
  4. B2.3.4Construct functions and modularizationPremium
  5. Unit testPremium
B2.4Programming algorithms5 lessons· Unit test
  1. B2.4.1Big O Notation and Algorithm EfficiencyFree
  2. B2.4.2Linear Search and Binary SearchPremium
  3. B2.4.3Bubble Sort and Selection SortPremium
  4. B2.4.4Recursion — Fundamental Concept and Applications (AHL)HLPremium
  5. B2.4.5Constructing and Tracing Recursive Algorithms (AHL)HLPremium
  6. Unit testPremium
B2.5File processing1 lesson· Unit test
  1. B2.5.1Sequential Files and File-Processing ConceptsFree
  2. Unit testPremium