Everything students need for J277 Paper 2 - Complete 12-page knowledge organiser and accompanying revision posters/mats for each topic. Each resource is provided as a pdf and editable PowerPoints.

All students need to revise for J277 Paper 2. Ideally printed in A3, these revision posters/mats can be completed by students alongside their use of the Knowledge Organiser (available seperately or as a bundle). Both a 12-page pdf and editable PowerPoint are provided

Three further exam questions on Object Oriented Programming in the style of OCR. Covers: Constructor methods Creating instances of objects Class declarations Class diagrams Inheritance Encapsulation Arrays/Queues Includes mark scheme

Perfect for A-Level Computer Science. Covers all of the C# basics and more students would need to be aware of (if this is the language you are covering). Better formatted, more appropriate and more complete (from an A-Level perspective) than anything else you will find online. Can be used as a display poster too. Pdf and Ms Word format

Updated 2024. Covers all students need to know for Paper 2 J277/02Computational thinking, algorithms and programming. A great revision resource for students. Supplied as a 12-page pdf and editable PowerPoint List of pages/topics: 01 - Computational Thinking and Flowcharts 02 - Searching and Sorting Methods and Key Words 03 - Searching and Sorting Algorithms 04 - Pseudocode Part A: Basics, String Manipulation, File Handling 05 - Pseudocode Part B: Selection, Iteration, Procedures and Functions 06 - Pseudocode Part C: Arrays and Trace Tables 07 - Databases and SQL 08 - Defensive Design 09 - Errors and Testing 10 - Logic Gates and Boolean Operators in Programming 11 - Translators and Types of Languages 12 - IDE (Integrated Development Environment) Can be used alongside the revision mats/posters (available separately or as a bundle)

Knowledge Organisers covering all of the main topics needed in preparation for Paper 2 (H446/02): Pseudocode (examples of all that they need to know) Computational Thinking (Thinking Abstractly, Thinking Ahead, Thinking Procedurally, Thinking Logically, Thinking Concurrently, Problem Recognition, Problem Solving) Further Programming Techniques (Classes and Objects, Encapsulation, Inheritance, Polymorphism, Recursion, Use of an IDE) Data Structures (Arrays, Tuples, Records, Stacks, Queues, Lists and linked Lists, Hash Tables, Dictionaries, Graphs, Trees) Algorithms (Big-O Notation, Search Algorithms, Sort Algorithms, Dijkstra’s Shortest Path Algorithm, A* Algorithm) Includes pdf and MS Word versions of each knowledge organiser for editing

Powerpoint slideshow that takes the user through example depth and breadth-first graph traversal, adding data items to and removing from stack and queue respectively . Accompanying pdf allows students to highlight lines of code relevant to each stage of the traversal

Knowledge Organiser covering: Thinking Abstractly Thinking Ahead Thinking Procedurally Thnking Logically Thinking Concurrently Problem Recognition Problem Solving Includes pdf and MS Word version for editing