More results...

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

Stacks and Queues in LMC

In this post we will investigate how to implement a queue and a stack data structure using low-level programming. We will use an upgraded version of Little Man Computer (LMC) that supports indirect addressing to to do. Implementing a Queue

Algebraic Pyramid Challenge

For the purpose of this challenge we will use algebraic pyramids pointing downwards (or upside down pyramids!). The idea of this mathematical puzzle is to fill in all the bricks of a pyramid based on the following rule: To work

Bracket Validator

The aim of this Python Challenge is to write a script to validate an arithmetic expression by checking that it has a valid sequence of opening and closing brackets. Let’s consider the following arithmetic expressions to decide whether they contain

Proportions and cross products

A proportion is simply a statement that two ratios are equal. The following are examples of proportions: 1/4 = 25/100 8/24 = 1/3 40/60 = 2/3 Proportions are often use in Maths to simplify a fraction or to represent a

Linked Lists

A linked-list is a dynamic data structure used in computer science. It consists of a collection of nodes where each node contains a piece of data (value) and a pointer (memory location) to the next node in the list. The

XOR Encryption Algorithm

The XOR Encryption algorithm is a very effective yet easy to implement method of symmetric encryption. Due to its effectiveness and simplicity, the XOR Encryption is an extremely common component used in more complex encryption algorithms used nowadays. The XOR

Eureka! (and King Hiero’s Crown)

Did you know? Archimedes is one of the most famous physicist, mathematician, astronomer and inventor of the classical age: He lived in Syracuse on the island of Sicily in the third century B.C. Many of his inventions and theories are

Searching & Sorting Algorithms Practice

The searching and sorting algorithms are key algorithms that you will study in computer science. Most computer programs involve some searching and sorting features so these key algorithms are often used when coding various computer programs. Searching and sorting algorithms

Taboo Revision Game (A Level)

Check our version of the Taboo game focusing on A level computer science terminology. The objective of the game is for a player to have their partners guess the word on the player’s card without using the word itself or

The commuter’s puzzle

Yuri lives in Oxford, UK and commutes by train to his work place in London every working day of the week (5 days a week). One evening, Yuri spot the Moon through the train window and asked himself the following