More results...

Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
post
page
Python IDE Dashboard
Author: Administrator

Time Conversion Algorithm

Did You Know? The 12-hour clock is a time convention in which the 24 hours of the day are divided into two periods: a.m. (from the Latin ante meridiem, meaning “before midday”) and p.m. (post meridiem, “after midday”). Each period

A Level Computer Science – Connect Wall

A Level Connect Wall Group the cards below in groups of 4 by clicking on each card. Next Level

GCSE Computer Science – Connect Wall

GCSE Connect Wall Group the cards below in groups of 4 by clicking on each card. Next Level

Python Turtle Spirograph

In this blog post we will create a spirograph using Python Turtle to draw different types of curves. Did you know? A Spirograph is a geometric drawing toy that produces mathematical roulette curves of the variety technically known as hypotrochoids

Complementary Colours Tool

Two colors are considered complimentary (or opposite) if they produce a neutral color — black, white, or grey — when mixed evenly. When placed next to each other, a colour and its complimentary colour create the strongest contrast that can

Python Turtle – Morphing Algorithm

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

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