Quick Links

Syllabus All Notes Class Library
Past Lesson Note

This note is from 1 month ago. You're viewing content from a previous lesson.

Daily Note for September 14, 2026 Past Lesson

Today we will review score distribution for the last test

We will also discuss your predicted grade, and your current grade.

We will review your test

We will preview B2: programming:

 

B2.1.1 Construct and trace programs using a range of global and local variables of various data types.
B2.1.2 Construct programs that can extract and manipulate substrings.
B2.1.3 Describe how programs use common exception handling techniques.
B2.1.4 Construct and use common debugging techniques.
B2.2.1 Compare static and dynamic data structures.
B2.2.2 Construct programs that apply arrays and Lists.
B2.2.3 Explain the concept of a stack as a “last in, first out” (LIFO) data structure.
B2.2.4 Explain the concept of a queue as a “first in, first out” (FIFO) data structure.
B2.3.1 Construct programs that implement the correct sequence of code instructions to meet program objectives.
B2.3.2 Construct programs utilizing appropriate selection structures.
B2.3.3 Construct programs that utilize looping structures to perform repeated actions.
B2.3.4 Construct functions and modularization.
B2.4.1 Describe the efficiency of specific algorithms by calculating their Big O notation to analyse their scalability.
B2.4.2 Construct and trace algorithms to implement a linear search and a binary search for data retrieval.
B2.4.3 Construct and trace algorithms to implement bubble sort and selection sort, evaluating their time and space complexities.
B2.4.4 Explain the fundamental concept of recursion and its applications in programming. (HL only) HL
B2.4.5 Construct and trace recursive algorithms in a programming language. (HL only) HL
B2.5.1 Construct code to perform file-processing operations.