Link to your online classroom: Click here to open

Paper 1
Test Average 0%
Paper 2
Test Average 0%

Tuition Feedback

Covered theory for Big O Notation & Djikstra’s Shortest Path Algorithm.

Useful revision resource: CodeInGame

Video Link: Click For Video

Today’s Notes: Charlotte Notes 16th January 2019

Exam technique revision lesson. Charlotte to complete essay question planned in the notes below for next lesson:

Charlotte Notes 12-12-18

Theory lesson on Application Software – Charlotte felt that this area had many gaps so we covered each section in detail.

Notes are linked in the revision section for Application Software below.

Following on from last lesson, we focused on exam technique today using the exam board exemplar questions.

Pseudocode is showing a clear improvement, and the more we practice, the more accurate the logic will become.

The notes from today may be downloaded here: Charlotte Notes 14-11-18

I have suggested that Charlotte watches the tutorial video below on linked lists to extend from the questions that we covered today.

Linked Lists Video

We focused on theory work from types of processor today (see revision list below). It appears that Charlotte has some knowledge gaps in this area, so we have been using Doodle Notes to bring her up to speed on these quickly.

Once these are completed, we will use past papers to apply the knowledge and work on exam technique.

We began to look at revision of internal hardware today. This has led to the identification of some significant gaps in her knowledge. To address this, I have added a list of OCR topics below to alow us to monitor progress and we are looking through the Structure of The CPU from foundations.

A copy of today’s notes may be found here: Charlotte Lesson Notes 24-10-18

Today’s lesson recording may be rewatched here: Click to Watch

Continued to use C to create a worked example of a queue.

It would be worth looking at the syntax of loops:


for ( int i = 0; i < 10; i++ ) {
  printf("d%", i);


while (true) 


do {
      printf( "Hello, world!\n" );
  } while ( x != 0 );

We were using the online C editor this week – it should allow you to create most of the required code:

Notes may be downloaded from:

Lesson recording:

In our first lesson we discussed Charlotte’s progress so far in college and identified that programming an algorithms have become a pinch point. With this in mind, we started today with a focus on writing pseudocode with more confidence.

The link to the official OCR pseudocode Guide is here.

Today’s notes may be downloaded here: Charlotte Lesson Notes 03-10-18

A recording of todays lesson may be seen here: Lesson Recording

(these are hosted as unlisted videos on YouTube which means they may only be accessed via a direct link)

I have not yet recieved confirmation that you have read & agreed to the Tuition Terms & Conditions. If I could ask you to confirm these before our next lesson, that would be great.

Revision Help

This section will contain useful links and hints from lessons.

This section will contain useful links & hints

Revision Planning

Hardware & Registers ๐Ÿ™

FDE Cycle

Factors Affecting Clock Speed


Harvard vs. Von Neumann

RISC vs CISC ๐Ÿ™‚ – RISC CISC – Doodle Notes

GPUs and their uses ๐Ÿ™‚

Multicore & parallel systems ๐Ÿ™‚ – Processor Types – Doodle Notes

Revision Video

Devices ๐Ÿ™‚ – Sensors – Doodle Notes

RAM / ROM ๐Ÿ™‚ – Main Memory – Doodle Notes

Types of Storage ๐Ÿ™‚ – Secondary Storage – Doodle Notes

Virtual Storage (Memory)ย  (still to complete) – Virtual Memory – Doodle Notes

Purposes & Uses ๐Ÿ™‚

Open vs Closed Sourceย  ๐Ÿ™‚

Translators ๐Ÿ™‚

Stages of Compilation ๐Ÿ™‚

Linkers & Loaders ๐Ÿ™‚ – BitPaper Notes: Charlotte Notes – 5-12-18

Methedologies ๐Ÿ™

Benefits & Drawbacks ๐Ÿ™

Writing & Drawing Algorithms ๐Ÿ™‚

Procedural Languages

Assembley (Direct ๐Ÿ™ Indirect ๐Ÿ™ Indexed ๐Ÿ™ )

Object Oriented ๐Ÿ™‚

Lossy vs Lossless ๐Ÿ™‚

RLE ๐Ÿ™‚

Symmetric & asymmetric encryption ๐Ÿ™‚

Different uses of hashing ๐Ÿ™‚

Intro To Databases Video

Relational Databases ๐Ÿ™

Normalisation to 3NF ๐Ÿ™

SQL ๐Ÿ™

Referential Integrity ๐Ÿ™

Transaction Processing ๐Ÿ™


Characteristics of a network ๐Ÿ™‚

Internet Structure ๐Ÿ™‚

Network Security ๐Ÿ™‚

Network Hardware ๐Ÿ™‚

Client Server / Peer to Peer ๐Ÿ™

Data Types ๐Ÿ™‚

Unsigned binary integers ๐Ÿ™‚

Two’s Complement ๐Ÿ™‚

Addition & Subtraction ๐Ÿ™‚

Hexadecimal ๐Ÿ™‚

Floating Point Normalisation :/


Floating Point Arithmetic ๐Ÿ™

Bitwise manipulation (shifts, AND, OR, XOR) ๐Ÿ™

Character Sets ๐Ÿ™‚

Arrays: 1 – 3 D arrays :/ – Charlotte Notes 14-11-18

Records, lists, tuples :/

Linked Lists ๐Ÿ™ – Video Tutorial

Graphs ๐Ÿ™

Stacks :/

Queues :/

Tree (Binary Tree) ๐Ÿ™

Hash Table ๐Ÿ™

Tree Traversal ๐Ÿ™

Karnaugh Maps for simplification ๐Ÿ™‚

Laws ofย  simplification: :/

  • De Morgan’s
  • Distribution
  • Association
  • Commutation
  • Double negation

Logic Gate Diagrams ๐Ÿ™‚

Logic Associated with D type flip flops, half and full adders ๐Ÿ™

Data Protection Act ๐Ÿ™‚ (GDPR)

Computer Misuse Act ๐Ÿ™‚

Copyright & Patents ๐Ÿ™‚

Regulation of Investigatory Powers Act ๐Ÿ™‚

  • Computers in the workforce
  • Automated decision making
  • AI
  • Environmental
  • Censorship
  • Monitor Behaviour
  • Analyse personal information
  • Piracy
  • Layout, colour paradigms, and character sets

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.