IBDP Computer Science, Theme B: Computational Thinking and Problem Solving - 9 Unit Planners Bundle

This comprehensive bundle contains 9 complete unit planners covering the entire IB DP Computer Science Theme B: Computational Thinking and Problem-Solving (FA2027). Designed for combined SL/HL classrooms across Year 1, Term 2–3 and Year 2, Term 2 (~100+ teaching hours).

9 Units Included:

B1.1 CT Approaches – Problem specification; abstraction, decomposition, pattern recognition, algorithmic design; flowchart tracing.

B2.1 Programming Fundamentals – Variables, data types, scope, substring manipulation, exception handling, debugging.

B2.2 Data Structures – Static vs dynamic; arrays/Lists (1D/2D); stacks (LIFO); queues (FIFO).

B2.3 Programming Constructs – Sequencing; selection (if/else, Boolean/relational operators); loops (counted/conditional); functions, parameters, modularization.

B2.4 Programming Algorithms – Big O notation; linear search (O(n)); binary search (O(log n)); bubble/selection sort (O(n²)). HL: recursion.

B2.5 File Processing – Read/write/append modes; exception handling for file I/O.

B3.1 OOP Single Class – Classes, objects, attributes, methods, constructors; UML; static vs instance; encapsulation (private/public, getters/setters).

B3.2 OOP Multiple Classes (HL) – Inheritance, polymorphism (overriding/overloading), abstraction (abstract classes), composition vs aggregation, design patterns (singleton, factory, observer).

B4.1 Abstract Data Types (HL) – Linked lists (singly/doubly/circular); BSTs (insert/delete/traverse/search); sets (union/intersection/difference); hash tables (hashing, collision resolution).

Activities – Flowchart tracing, code writing, debugging, stack/queue simulations, search/sort tracing, file I/O, UML, inheritance hierarchies, linked list/BST drawing, hash table simulations.

Assessment – Formative (exit tickets, trace tables) + Summative (unit tests: MCQs, scenarios, practical programming).

Differentiation – Scaffolding (templates, syntax cards); extension (research); affirming identity (everyday analogies).

Cross-curricular – TOK (formal vs natural language, modelling reality); CAS (tutoring, community projects).

CT Skills – Abstraction, decomposition, pattern recognition, algorithmic thinking.

Resources – Craig’n’Dave, CS Field Guide, GeeksforGeeks, W3Schools, VisuAlgo, IB Guide, lab materials.

Pacing – 9 units (~100+ teaching hours).

#IBDP #IBComputerScience #ThemeB #ComputationalThinking #Programming #DataStructures #Algorithms #OOP #ADT #LinkedList #BinarySearchTree #HashTable #BigONotation #Recursion #FileProcessing #UML #Inheritance #Polymorphism #DesignPatterns #SLHL #HLOnly #IBTeachers #CompleteBundle