In our previous blog post “from transistors to processors” we found out that the CPU consists of logic gates, which are made using transistors. In this blog post we are looking at how these logic gates can be combined to…
Vacuum Tubes and Transistors: Many consider the transistor to be one of the most important inventions of all time. Though the precursors of the transistor were invented in 1907 (at the time they were not transistors yet, they were vacuum…
For this challenge you will use a graph data structure to create an Air Fligh Route Planner for a fictitious airline company offering flights across Europe. Here is a map showing all the direct flights offered by this airline company:…
Six Degrees of Separation The Six degrees of separation is an idea that was originally set out by Frigyes Karinthy in 1929 and that can be applied to Social Networks such as Facebook. It is based on the idea that…
One method to estimate the value of π (3.141592…) is by using a Monte Carlo method. This methods consists of drawing on a canvas a square with an inner circle. We then generate a large number of random points within…
In this blog post we will use Glowscript to create a 3D animation of a space invader. 2D Graphics used in retro arcade games consist of pixels. A 2D graphic can be described as a grid of pixels of different…
The aim of this Python challenge is to investigate how graphs can be used in Computer Science and investigate the key algorithms used when manipulating graphs in Python such as an algorithm to find the shortest path between two nodes…
The Insertion sort algorithm is one of the key sorting algorithms used in Computer Science. To start with, the algorithm considers the first value of a list as a sorted sub-list (of one value to start with). This iterative algorithm…
The Bubble sort algorithm is one of the key sorting algorithms used in Computer Science. It is a fairly simple algorithm to implement and is particularly useful when you need to find the top x values of a list. The…
The purpose of this Python challenge is to demonstrate the use of a backtracking algorithm to find the exit path of Maze. Backtracking Algorithm A backtracking algorithm is a recursive algorithm that attempts to solve a given problem by testing…