Tuition Feedback

Your online classroom: Click here to open

OCR Specification can be downloaded here

Saturday lessons now back on schedule.

We were looking at OCR exam technique today with a focus on hardware.

Lesson notes can be downloaded here: Kendal Notes 29-9-18


Please complete the final essay question. Using the mark scheme, I’d like you to reverse engineer the question by creating a mindmap and essay. The mark sheme only shows the basic points & top band marks – how can you use this to create an excellent essay?

Pseudocode for projects & Programming paper.

Working in pairs is really useful for getting to grips with pseudocode. Good practice for this is to take a program that you can code together with one writing pseudocode & the other using the pseudocode to program. After minutes, swap roles. This would work really well with you and Elly working together.

We used the OCR Pseudocode Guide today which you should find really useful for your Project work.

This is the link for today’s BitPaper: 18-08-18 Bitpaper

Revision Links

Hardware & Registers ๐Ÿ™

FDE Cycle ๐Ÿ™‚

Factors Affecting Clock Speed ๐Ÿ™‚

Pipelining ๐Ÿ™

Harvard vs. Von Neumann ๐Ÿ™‚


GPUs and their uses ๐Ÿ™

Multicore & parallel systems :/

Devices :/

RAM / ROM ๐Ÿ™‚

Types of Storage ๐Ÿ™‚

Virtual Storage (Memory)ย  ๐Ÿ™


Cover this topic

Purposes & Uses ๐Ÿ™

Open vs Closed Sourceย  ๐Ÿ™‚

Translators ๐Ÿ™‚

Stages of Compilation ๐Ÿ™

Linkers & Loaders ๐Ÿ™

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 ๐Ÿ™‚

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 :/

Records, lists, tuples :/

Linked Lists ๐Ÿ™

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.