Tweening/Morphing effects are often used in Computer Animations to change the shape of an object by morphing an object from one shape into another. In tweening, key frames are provided and “in-between” frames are calculated to make a smooth looking…
Learning Zone ✕
Theory Concepts
Cryptography Computer Hardware Computer Networks Algorithms OOP Programming Binary Data Boolean Logic Database ConceptsInteractive Quizzes
View All QuizzesGCSE Computer Science (UK)
1.1 System Architecture 1.2 Memory and Storage 1.3 Computer networks 1.4 Network security 1.5 – Systems software 1.6 – Impacts of digital technology2.1 – Algorithms 2.2 – Programming fundamentals 2.3 – Producing robust programs 2.4 – Boolean logic 2.5 – Programming languages and IDEs
A-Level Computer Science (UK)
1.1 Contemporary processors, input, output and storage devices 1.2 Software and software development 1.3 Exchanging data 1.4 Data types, data structures and algorithms 1.5 Legal, moral, cultural and ethical issues2.1 Elements of computational thinking 2.2 Problem solving and programming 2.3 Algorithms
Coding Challenges ✕
Python Challenges
Python Challenges - All Levels Python Challenges - Beginner Level Python Challenges - Intermediate Level Python Challenges - Advanced Level Python Turtle Challenges Solved ChallengesBlock Programming
BBC micro:bit Challenges Scratch ChallengesInteractive Coding Puzzles
Pirate Island Space Explorer Interactive Coding QuizzesOnline Interactive Tools ✕
More results...
Member's Area ✕
Author: Administrator
Machine Learning – Top Trumps Game
The purpose of this post is to demonstrate a basic example of how machine learning works. In this example, the computer learns how to play a game of Top Trumps more effectively to increase its chance of winning the game.…
Heuristic Approaches to Problem Solving
“A heuristic technique, often called simply a heuristic, is any approach to problem solving, learning, or discovery that employs a practical method not guaranteed to be optimal or perfect, but sufficient for the immediate goals. Where finding an optimal solution…
A* Search Algorithm
The A* Search algorithm (pronounced “A star”) is an alternative to the Dijkstra’s Shortest Path algorithm. It is used to find the shortest path between two nodes of a weighted graph. The A* Search algorithm performs better than the Dijkstra’s…
Dijkstra’s Shortest Path Algorithm
Dijkstra’s Shortest Path Algorithm is an algorithm used to find the shortest path between two nodes of a weighted graph. Before investigating this algorithm make sure you are familiar with the terminology used when describing Graphs in Computer Science. Let’s…
Boolean Algebra
In this blog post we are investigating different formulas than can be used to simplify a Boolean expression. Double Negation ¬ ¬A = A Complement Laws A ∧ ¬A = 0 A ∨ ¬A = 1 Idempotent Laws A ∧…
Big O Notation
The question we will try to answer in this blog post is as follows: How can we measure the effectiveness/performance of an algorithm? First let’s consider this quote from Bill Gates (Founder of Microsoft): “Measuring programming progress by lines of…
Graph Terminology
Graphs are a data structure that can be used in computer science in a variety of context. You can check the following Python challenges which are all being solved using a graph and a short path algorithm, one of the…
Network Security – Terminology
Click on the picture below to check your knowledge of key Network Security concepts: Forms of attacks, threats and approaches to secure a network.
Random Access Memory using Logic Gates
In our previous blog post, “Binary Additions using Logic Gates”, we investigated how logic gates can be used together to create a circuit used in the ALU (Arithmetic & Logic Unit of the CPU) to add two binary numbers together.…
LMC Simulator
Logic Gates Circuits
Network Designer
Flowchart Studio
Online Python IDE