Tuition Feedback
Your online classroom: Click here to open
OCR Specification can be downloaded here
29th September 2018
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
Homework:
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?
18th August 2018
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 🙂
RISC vs CISC 🙁
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 🙁
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 :/
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 🙁