Link to your online classroom: Click here to open
Tuition Feedback
16th January 2019
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
12th December 2018
Exam technique revision lesson. Charlotte to complete essay question planned in the notes below for next lesson:
5th December 2018
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.
14th November 2018
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.
7th November
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.
24th October
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
17th October 2018
Continued to use C to create a worked example of a queue.
It would be worth looking at the syntax of loops:
FOR:
for ( int i = 0; i < 10; i++ ) { printf("d%", i); }
WHILE:
while (true) { take_turn(player1); take_turn(player2); }
DO WHILE:
do { printf( "Hello, world!\n" ); } while ( x != 0 );
10th October
We were using the online C editor this week – it should allow you to create most of the required code: https://repl.it/repls/ForthrightClearcutDigit
Notes may be downloaded from:
Lesson recording:
3rd October 2018
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
Revision Planning
Hardware & Registers 🙁
FDE Cycle
Factors Affecting Clock Speed
Pipelining
Harvard vs. Von Neumann
RISC vs CISC 🙂 – RISC CISC – Doodle Notes
GPUs and their uses 🙂
Multicore & parallel systems 🙂 – Processor Types – Doodle Notes
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
Cover this topic
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 🙂
Relational Databases 🙁
Normalisation to 3NF 🙁
SQL 🙁
Referential Integrity 🙁
Transaction Processing 🙁
ACID 🙁
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 :/
(MxBe)
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