IB Computer Science Topic B2: Programming

B2.1.1 Constructing and Tracing Programs Using Global and Local Variables of Various Data Types

B2.1.2 Constructing Programs That Extract and Manipulate Substrings

B2.1.3 How Programs Use Common Exception Handling Techniques

B2.1.4 Constructing and Using Common Debugging Techniques

B2.2.1 Comparing Static and Dynamic Data Structures

B2.2.2 Constructing Programs That Apply Arrays and Lists

B2.2.3 Concept of a Stack as a "Last In, First Out" (LIFO) Data Structure

B2.2.4 Concept of a Queue as a "First In, First Out" (FIFO) Data Structure

B2.3.1 Constructing Programs That Implement the Correct Sequence of Code Instructions

B2.3.2 Constructing Programs Utilizing Appropriate Selection Structures

B2.3.3 Constructing Programs That Utilize Looping Structures

B2.3.4 Constructing Functions and Modularization

B2.4.1 Efficiency of Specific Algorithms and Big O Notation

B2.4.2 Constructing and Tracing Algorithms for Linear and Binary Search

B2.4.3 Constructing and Tracing Bubble Sort and Selection Sort, Evaluating Time and Space Complexities

B2.4.4 Fundamental Concept of Recursion and Its Applications in Programming (HL only)

B2.4.5 Constructing and Tracing Recursive Algorithms in a Programming Language (HL only)

B2.5.1 Constructing Code to Perform File-Processing Operations