Report an issue

IB Computer Science Topic 4. Computational Thinking,… | RevisionDojo

FeaturesSubjectsPricing Schools

Loading subject…

IB
4. Computational thinking, problem-solving and programming

IB Computer Science 4. Computational Thinking, Problem-solving and Programming

1.1 Systems in organizations

1.2 System design basics

2.1 Computer organization

3.1 Networks

4.1 General principles

4.2 Connecting computational thinking and program design

4.3 Introduction to programming

5.1 Abstract data structures

6.1 Resource management

7.1 Control

A.1 Basic concepts

A.2 The relational database model

A.3 Further aspects of database management

A.4 Further database models and database analysis

B.1 The basic model

B.2 Simulations

B.3 Visualization

B.4 Communication modelling and simulation

C.1 Creating the web

C.2 Searching the web

C.3 Distributed approaches to the web

C.4 The evolving web

C.5 Analysing the web

C.6 The intelligent web

D.1 Objects as a programming concept

D.2 Features of OOP

D.3 Program development

D.4 Advanced program development

IB Computer Science Topic 4. Computational Thinking, Problem-solving and Programming (SL/HL) covers syllabus content. Use these Notes, Questionbank, Flashcards, and Lessons to review the topic, practise exam questions, and move between notes, videos, flashcards, and lessons where available.

Practice

Question Bank

Practice questions with AI feedback

84 questions

Learn

Study Guide

Bite-sized topic summaries

51 chapters

Lessons

Step-by-step lessons and quizzes

23 lessons

Flashcards

Remember concepts with active recall

19 flashcard decks

Reference

Key Definitions

Essential terms and concepts explained

29 definitions

4.1.1 Procedures and Sub-Procedures

4.1.2 Decision-Making Situations

4.1.3 Inputs and Outputs in a Solution

4.1.4 Pre-Planning in Problem Solutions

4.1.5 Pre- and Post-Conditions

4.1.6 Exceptions in Problem Solutions

4.1.7 Understanding Concurrency

4.1.8 Abstraction

4.2.1 The Choice of Algorithms and Standard Algorithms

4.2.2 Standard Operations of Collections

4.2.3 Algorithm as a Flow Chart

4.2.4 Constructing Pseudocode

4.2.5 Efficiency of Algorithms

4.3.1 Fundamental Operations of a Computer

4.3.2 Features of a Computer Language

4.3.3 Need for Higher-Level Languages

4.3.4 Variables, Constants, and Operators

4.3.5 Algorithms with Loops and Branching

4.3.6 Characteristics of a Collection

What this topic covers