2.1.3

Pseudocode & Flow Diagrams

Test yourself

Pseudocode

Pseudocode is a common way of representing an algorithm.

Illustrative background for PseudocodeIllustrative background for Pseudocode ?? "content

Pseudocode

  • Pseudocode is a way to write out algorithms using code-like statements.
  • It is intended to be very readable, and easy to understand.
Illustrative background for Purpose of pseudocodeIllustrative background for Purpose of pseudocode ?? "content

Purpose of pseudocode

  • Pseudocode isn't a programming language.
  • Pseudocode is used to plan algorithms, focusing on the logic and steps rather than language-specific syntax.
Illustrative background for OCR pseudocodeIllustrative background for OCR pseudocode ?? "content

OCR pseudocode

  • OCR have produced their own pseudocode which will be used in this course.
  • You do not need to write pseudocode exactly as they do, as long as it is clear what you are doing.
  • You do need to be able to understand their style of pseudocode.

Flow Diagrams

Flow diagrams are used to represent a given algorithm.

Illustrative background for Flow diagramsIllustrative background for Flow diagrams ?? "content

Flow diagrams

  • Flow diagrams are used to visually represent the steps that make up an algorithm.
  • A standard set of shapes are used to represent different types of step.
  • Arrows represent the flow of control, or what to execute next.
Illustrative background for Standard shapesIllustrative background for Standard shapes ?? "content

Standard shapes

  • An oval is used for the start and end of a program.
  • A rectangle is used to represent a process.
Illustrative background for Standard shapesIllustrative background for Standard shapes ?? "content

Standard shapes

  • A parallelogram is used to represent an input or an output.
  • A diamond is used to represent a decision:
    • A decision has two labelled arrows coming out of it.
    • The 'Yes' arrow is followed if the condition in the diamond was true, otherwise the 'No' arrow is followed.

Jump to other topics

1Computer Systems

1.1Systems Architecture

1.1.1Architecture Introduction

1.1.2Von Neumann Architecture

1.1.3Fetch-Execute Cycle

1.1.4Factors Affecting CPU Performance

1.1.5Elements of Computer Systems

1.1.6Exam-Style Questions - Von Neumann Architecture

1.2Memory & Storage

1.2.1Types of Memory

1.2.2Flash Memory

1.2.3Virtual Memory

1.2.4Exam-Style Questions - Primary Memory

1.2.5Capacity

1.2.6Solid State Storage

1.2.7Magnetic Storage

1.2.8Examples of Magnetic Storage

1.2.9Optical Storage & its Properties

1.2.10Examples of Optical Storage

1.2.11End of Topic Test - Computer Systems

1.2.12Grade 9 - Storage

1.2.13Exam-Style Questions - Storage

1.2.14Units of Information

1.2.15Number Bases

1.2.16Converting Number Bases

1.2.17Hexadecimal

1.2.18Binary Arithmetic

1.2.19Representing Text

1.2.20ASCII & Unicode

1.2.21Representing Images

1.2.22Representing Sound

1.2.23Data Compression

1.2.24End of Topic Test - Representation

1.2.25Exam-Style Questions -Data Conversions

1.3Computer Networks, Connections & Protocols

1.3.1Benefit of Networks

1.3.2Network Performance

1.3.3Networks: How Do Packets Get Routed?

1.3.4Types of Networks

1.3.5Client-Server Model

1.3.6Pros & Cons of Client-Server Model

1.3.7Peer-to-Peer Model

1.3.8Pros & Cons of Peer-to-Peer Model

1.3.9Network Hardware

1.3.10What is the Internet?

1.3.11URLs

1.3.12DNS & Web Hosting

1.3.13The Cloud

1.3.14Pros & Cons of the Cloud

1.3.15Exam-Style Questions - Networking Models

1.3.16Topology

1.3.17WiFi

1.3.18WiFi Encryption

1.3.19IP Addresses

1.3.20MAC Addresses

1.3.21Network Protocols

1.3.22Application Protocols

1.3.23Layers

1.3.24Advantages of Layering

1.3.25Exam-Style Questions - Network Protocols

1.4Network Security

1.4.1Forms of Attack

1.4.2Malware

1.4.3Social Engineering

1.4.4Phishing

1.4.5Common Active Attacks

1.4.6Information Security

1.4.7SQL Injection

1.4.8Network Administration

1.4.9Protecting Against Malware

1.4.10Authentication & Passwords

1.4.11Encryption

1.4.12End of Topic Test - Networks

1.5Systems Software

1.5.1Types of System Software

1.5.2Operating Systems

1.5.3Operating System Managers

1.5.4File Management

1.5.5Device Management

1.5.6User Management

1.5.7Utility Software: Encryption & Defragmentation

1.5.8Utility Software: Data Compression & Backup

1.6Ethical, Legal, Cultural & Environmental Concern

1.6.1Open Source vs Proprietary Software

1.6.2Licensing Issues

1.6.3Ethical Issues

1.6.4Ethical Issues 2

1.6.5Exam-Style Questions - Ethical Issues

1.6.6Legal Issues

1.6.7Legal Issues 2

1.6.8Freedom of Information Act (2000)

1.6.9Cultural Issues

1.6.10Environmental Issues

1.6.11Positive Environmental Impact

1.6.12Privacy Issues

1.6.13Stakeholders

1.6.14End of Topic Test - Software & Issues

2Computational Thinking, Algorithms and Programming

2.1Algorithms

2.1.1Computational Thinking

2.1.2Algorithmic Thinking

2.1.3Pseudocode & Flow Diagrams

2.1.4Interpreting & Correcting Algorithm

2.1.5Completing Algorithms

2.1.6Search Algorithms

2.1.7Binary Search

2.1.8Overview of Sort Algorithms

2.1.9Bubble Sort & Insertion Sort

2.1.10Merge Sort

2.1.11Exam-Style Questions - Sorting Algorithms

2.2Programming Fundamentals

2.2.1Fundamentals

2.2.2Program Flow 1

2.2.3Program Flow 2

2.2.4Arithmetic & Relational Operators

2.2.5Boolean Operators

2.2.6Data Types

2.2.7Arrays

2.2.8Strings

2.2.9File Handling

2.2.10Structuring Data

2.2.11End of Topic Test - Programming

2.2.12Exam-Style Questions - Translation

2.3Producing Robust Programs

2.3.1Defensive Design Considerations

2.3.2Defensive Design Considerations 2

2.3.3Maintainability

2.3.4Testing

2.3.5Test Plans

2.3.6Error Types

2.3.7End of Topic Test - Programming

2.3.8Exam-Style Questions - Testing

2.4Boolean Logic

2.4.1Computational Logic

2.4.2Boolean Logic

2.4.3Boolean Operators

2.4.4Grade 9 - Logic

2.5Programming Languages & IDEs

2.5.1High-Level vs Low-Level Languages

2.5.2Translation - Compliers & Interpreter

2.5.3Translation - Assemblers

2.5.4Integrated Development Environments

2.5.5Exam-Style Questions - Translation

Go student ad image

Unlock your full potential with GoStudent tutoring

  • Affordable 1:1 tutoring from the comfort of your home

  • Tutors are matched to your specific learning needs

  • 30+ school subjects covered

Book a free trial lesson

Algorithmic Thinking

Interpreting & Correcting Algorithm