Teacher Resources (new)
B 2.2.3 Stacks Python
This section explores the stack data structure, which operates on the LIFO principle (like a stack of plates!). We'll cover key operations (push, pop, peek, isEmpty), their efficiency, and how to choose...
Activities
B 2.2.3 Worksheet Java
Name: _________________________ This worksheet uses the standard Java Stack class, which has the following methods: Instructions: For each problem, trace the operations in the order given. Sketch the...
Activities
B 2.2.3 Worksheet Java Answers
Final Stack: Printed: Final Stack: Printed: Final Stack: [] (Empty) Final Stack: Description: An EmptyStackException is thrown. You cannot pop() from an empty stack. Final Stack: [] (Empty) 1. Sum of...
Activities
B 2.2.3 Worksheet Python
Name: _________________________ This worksheet uses a standard Python list as a stack, which has the following methods: Instructions: For each problem, trace the operations in the order given. Sketch...
eBook
B 2.2.2 Arrays and Lists Python
This section explores how arrays and lists are used in Java and Python. We'll delve into one-dimensional and two-dimensional arrays, as well as ArrayLists. You'll learn how to manipulate these data structures,...
Teacher Resources (new)
A 2.1.2 Modern Digital Infrastructures
Digital infrastructures connect us globally, enabling communication, data storage, services, and innovation. Benefits include efficiency, access to information, and economic growth. Limitations include...
Teacher Resources (new)
B 4.1.6 Core principles of ADTs - Python (HL Only)
These lessons focus on Abstract Data Types (ADTs) and Hash Tables/Maps. They cover core concepts like key-value pairs, hashing functions, collision resolution (linear probing and chaining), load factor,...
Teacher Resources (new)
B 4.1.3 Construct and apply linked lists - Python (HL Only)
The syllabus subtopic B4.1.3 focuses on the practical skill of constructing and applying various types of linked lists within the Diploma Programme (DP) Computer Science course, specifically for Higher...
Teacher Resources (new)
B 4.1.5 Construct and apply sets as an ADT Python
This resource provides four complete one-hour lessons for teaching IB Computer Science topic B4.1.5, Sets as an ADT, using Python. Students will master set characteristics, union, intersection, difference,...
Teacher Resources (old)
5.1 Linked lists
This section discusses linked lists, focusing on their features and characteristics as dynamic data structures. It emphasises understanding the concepts of nodes and pointers. It also outlines how linked...