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

<p>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.</p>

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

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

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

<p>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</p> <p>List of pages/topics:<br /> 01 - Computational Thinking and Flowcharts<br /> 02 - Searching and Sorting Methods and Key Words<br /> 03 - Searching and Sorting Algorithms<br /> 04 - Pseudocode Part A: Basics, String Manipulation, File Handling<br /> 05 - Pseudocode Part B: Selection, Iteration, Procedures and Functions<br /> 06 - Pseudocode Part C: Arrays and Trace Tables<br /> 07 - Databases and SQL<br /> 08 - Defensive Design<br /> 09 - Errors and Testing<br /> 10 - Logic Gates and Boolean Operators in Programming<br /> 11 - Translators and Types of Languages<br /> 12 - IDE (Integrated Development Environment)</p> <p>Can be used alongside the revision mats/posters (available separately or as a bundle)</p>

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

<p>Knowledge Organiser covering:</p> <ul> <li>Thinking Abstractly</li> <li>Thinking Ahead</li> <li>Thinking Procedurally</li> <li>Thnking Logically</li> <li>Thinking Concurrently</li> <li>Problem Recognition</li> <li>Problem Solving</li> </ul> <p>Includes pdf and MS Word version for editing</p>