Activities
Pseudocode 1: Input and output
For this worksheet you need to know two of the main pseudocode commands; "input" and "output". It's important to be familiar with two main pseudocode commands: input and output. These commands will be...
Activities
Pseudocode 6: Collections
In programming, a collection is a versatile data structure used to store and manage groups of related objects. The collection elements do not have to be of the same type. Unlike arrays, collections are...
Activities
Pseudocode 5: 1D Arrays
In computer science, a 1D array (one-dimensional array) is a data structure that stores homogeneous elements, each identified by an index or position. Each element in the array is accessed using an index....
Activities
Pseudocode 4: Loops
In this worksheet, we’ll dive into the concept of loops. Loops are essential when you need to perform the same operation repeatedly, such as processing items in a list, running a calculation until a condition...
Activities
Pseudocode 3: Conditional operations
In this worksheet, you'll explore the fundamentals of conditional operations in pseudocode. Conditional operations allow your programs to make decisions based on certain conditions, enabling them to perform...
Activities
3.1.2 OSI and protocols - Exercises
3.1.2 OSI and protocols - Exercises Protocols are the standard terms that computers use to understand each other. Two computers must have one or more protocols in common to exchange the data. Before 1980,...
Activities
D.2 Features of OOP Exercises
1. Define the term encapsulation. 2. Explain the advantages of encapsulation. 3. What is the JAVA keyword that indicates that one class inherits another? 4. Consider the following code Write the code...
Activities
D.2 Features of OOP Answers
1. Define the term encapsulation. Encapsulation in Java is a mechanism of wrapping the data (variables) and code acting on the data (methods) together as as single unit. 2. Explain the advantages of encapsulation....
eBook
Topic 4 - Computational thinking
This section is not just a standalone topic. It’s connected to all other sections, particularly those involving flow charts, pseudocode, and programming in the SL/HL core, as well as abstract data structures...
Activities
Topic 5.1 - Thinking Recursively - Exercises
Thinking recursively worksheet Remember: Parts of a Recursive Algorithm All recursive algorithms must have the following: The "work toward base case" is where we make the problem simpler. The recursive...