Quizlet Links
- Review/revision
- Quizlet Links

Quizlet Flashcard Links
This section provides links to Quizlets for the Learning Statements in the syllabus. Quizlets are more than just a flashcard and are an excellent way for you to make sure you have learnt and understood all of the key terms in the new syllabus. Click on the plus signs to expand the boxes.
| Subtopic | Learning Statement | Level |
|---|---|---|
| B1.1 Approaches to computational thinking | B1.1.1 Construct a problem specification. | SL |
| B1.1.2 Describe the fundamental concepts of computational thinking. | SL | |
| B1.1.3 Explain how applying computational thinking to fundamental concepts is used to approach and solve problems in computer science. | SL | |
| B1.1.4 Trace flowcharts for a range of programming algorithms. | SL |
| Subtopic | Learning Statement | Level |
|---|---|---|
| B2.1 Programming fundamentals | B2.1.1 Construct and trace programs using a range of global and local variables of various data types. | SL |
| B2.1.2 Construct programs that can extract and manipulate substrings. | SL | |
| B2.1.3 Describe how programs use common exception handling techniques. | SL | |
| B2.1.4 Construct and use common debugging techniques. | SL | |
| B2.2 Data structures | B2.2.1 Compare static and dynamic data structures. | SL |
| B2.2.2 Construct programs that apply arrays and Lists. | SL | |
| B2.2.3 Explain the concept of a stack as a “last in, first out” (LIFO) data structure. | SL | |
| B2.2.4 Explain the concept of a queue as a “first in, first out” (FIFO) data structure. | SL | |
| B2.3 Programming constructs | B2.3.1 Construct programs that implement the correct sequence of code instructions to meet program objectives. | SL |
| B2.3.2 Construct programs utilizing appropriate selection structures. | SL | |
| B2.3.3 Construct programs that utilize looping structures to perform repeated actions. | SL | |
| B2.3.4 Construct functions and modularization. | SL | |
| B2.4 Programming algorithms | B2.4.1 Describe the efficiency of specific algorithms by calculating their Big O notation to analyse their scalability. | SL |
| B2.4.2 Construct and trace algorithms to implement a linear search and a binary search for data retrieval. | SL | |
| B2.4.3 Construct and trace algorithms to implement bubble sort and selection sort, evaluating their time and space complexities. | SL | |
| 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 File processing | B2.5.1 Construct code to perform file-processing operations. | SL |
| Subtopic | Learning Statement | Level |
|---|---|---|
| B3.1 Fundamentals of OOP for a single class | B3.1.1 Evaluate the fundamentals of OOP. | SL |
| B3.1.2 Construct a design of classes, their methods and behaviour. | SL | |
| B3.1.3 Distinguish between static and non-static variables and methods. | SL | |
| B3.1.4 Construct code to define classes and instantiate objects. | SL | |
| B3.1.5 Explain and apply the concepts of encapsulation and information hiding in OOP. | SL | |
| B3.2 Fundamentals of OOP for multiple classes (HL only) | B3.2.1 Explain and apply the concept of inheritance in OOP to promote code reusability. | SL |
| B3.2.2 Construct code to model polymorphism and its various forms, such as method overriding. | SL | |
| B3.2.3 Explain the concept of abstraction in OOP. | SL | |
| B3.2.4 Explain the role of composition and aggregation in class relationships. | SL | |
| B3.2.5 Explain commonly used design patterns in OOP. | SL |
| Subtopic | Learning Statement | Level |
|---|---|---|
| B4.1 Fundamentals of ADTs | B4.1.1 Explain the properties and purpose of ADTs in programming. | HL |
| B4.1.2 Evaluate linked lists. | HL | |
| B4.1.3 Construct and apply linked lists: singly, doubly and circular. | HL | |
| B4.1.4 Explain the structures and properties of BSTs. | HL | |
| B4.1.5 Construct and apply sets as an ADT. | HL | |
| B4.1.6 Explain the core principles of ADTs. | HL |
How to Understand Exam Questions
When you're taking an exam, you'll see certain words and phrases used in the questions. These terms have specific meanings, and you should know what they are. While these terms appear often, other words might also be used to guide you on how to structure your answer.
Here are some common terms you'll encounter and what they mean:
- Analyse: Break down a topic into its parts and explain how they relate to each other.
- Compare and Contrast: Identify the similarities and differences between two or more things.
- Evaluate: Look at the strengths and weaknesses of something and make a judgment about its value or significance.
- Discuss: Present a balanced argument by exploring different aspects of a topic.
- Explain: Make something clear by describing it in detail.
Mastering these terms will help you understand exactly what the examiner is asking for, so you can score higher marks.
Here are all of the terms you will find in your IB DP Computer Science exams.