Author: Administrator

Heads or Tails


In this challenge we will create a game of heads to tails using the following rules: The game will consist of 5 rounds. In each round: the user will make a guess, the computer will flip a coin, the player

Javascript: Alert, prompt or confirm?


Javascript popup box are extremely useful when you start coding in Javascript. They enable you to write basic programs based on the Input/Process/Output very easily. alert(“…”) An alert box is an easy approach in javascript to display a message to

Network Design Tasks


In this post we will investigate the different components needed to set up a network. We will investigate specific customer requirements to create suitable network designs. You will use our online network design tool to create these designs using the

Divisibility Rules


For this challenge we will investigate a range of algorithms used to apply some of the most common divisibility rules. We will first focus on the divisibility rule of 3 to introduce the concept of recursion. A divisibility rule is

Number 2520?


Did you know that 2520 is the smallest number exactly divisible by all integers from 1 to 10. The aim of this challenge is to write a python script to work out this number from its definition. Note that a

Vatsyayana cipher


The Vatsyayana cipher is a simple substitution cipher where the 26 letters of the alphabet are organised into 13 pairs of characters. These pairs are then used to encrypt the text by direct substitution of the letters in the pairs.

Caesar Shift (Substitution Cipher)


A Caesar Shift cipher is a type of mono-alphabetic substitution cipher where each letter of the plain text is shifted a fixed number of places down the alphabet. For example, with a shift of 1, letter A would be replaced

Frequency Analysis


In cryptography, frequency analysis is the study of the frequency of letters or groups of letters in a ciphertext. The method is used as an aid to breaking substitution ciphers (e.g. mono-alphabetic substitution cipher, Caesar shift cipher, Vatsyayana cipher). Frequency

Mono-Alphabetic Substitution Cipher


A mono-alphabetic cipher (aka simple substitution cipher) is a substitution cipher where each letter of the plain text is replaced with another letter of the alphabet. It uses a fixed key which consist of the 26 letters of a “shuffled

Shuffling a 2D Array


For this challenge we will investigate how to create a 2D array to store the value from 1 to 100 in a 10×10 array. We will then write an algorithm to shuffle the content of this array. See the code