Katas Statements

roman-numerals.md

Roman Numerals Kata

The Romans were a clever bunch. They conquered most of Europe and ruled it for hundreds of years. They invented concrete and straight roads and even bikinis. One thing they never discovered though was the number zero. This made writing and dating extensive histories of their exploits slightly more challenging, but the system of numbers they came up with is still in use today. For example the BBC uses Roman numerals to date their programmes.

The Romans wrote numbers using letters - I, V, X, L, C, D, M. (notice these letters have lots of straight lines and are hence easy to hack into stone tablets)

The Kata says you should write a function to convert from normal numbers to Roman Numerals:

1  --> I
10 --> X
7  --> VII
etc.

For a full description of how it works, take a look at this useful site: which includes an implementation of the Kata in javascript.

There is no need to be able to convert numbers larger than about 3000. (The Romans themselves didn't tend to go any higher)

Note that you can't write numerals like "IM" for 999. Wikipedia says:

Modern Roman numerals (...) are written by expressing each digit separately starting with the left most digit and skipping any digit with a value of zero. To see this in practice, consider the (...) example of 1990. In Roman numerals 1990 is rendered: 1000=M, 900=CM, 90=XC; resulting in MCMXC. 2008 is written as 2000=MM, 8=VIII; or MMVIII.

Part II of the Kata

Write a function to convert in the other direction, ie numeral to digit

Clues

• Can you make the code really beautiful and highly readable?
• Does it help to break out lots of small named functions from the main function, or is it better to keep it all in one function?
• If you don't know an algorithm to do this already, can you derive one using strict TDD?
• Does the order you take the tests in affect the final design of your algorithm?
• Would it be better to work out an algorithm first before starting with TDD?
• If you do know an algorithm already, can you implement it using strict TDD?
• Can you think of another algorithm?
• What are the best data structures for storing all the numeral letters? (I, V, D, M etc)
• Can you define the test cases in a csv file and use FIT, or generate test cases in xUnit?
• What is the best way to verify your tests are correct?

Suggested Test Cases

Exercise left to the reader. You could use 1999 as an acceptance test.

stack-kata.md

Stack Kata

Una pila típica es un área de la memoria de los computadores con un origen fijo, un espacio para almacenar datos y un puntero. Al principio, su número de elementos es cero y la dirección del puntero coincide con la dirección de origen. Conforme van incorporándose datos, los elementos contenidos en la pila van incrementándose y el puntero va actualizando su dirección para hacerla coincidir con el último en incorporase.

Las dos operaciones aplicables a todas las pilas son:

• Push: colocar un nuevo dato en la pila. Se lee el puntero para localizar el último elemento, se incorpora a continuación de este y se redirecciona el puntero para que apunte al nuevo dato incorporado.
• Pop: extraer un dato de la pila. Se localiza el último dato mediante el puntero, se lee el dato y se redirecciona el puntero al elemento inmediato anterior para que vuelva a apuntar al último dato de la pila. Una pila queda definida por su origen (una dirección de memoria), y su capacidad para almacenar datos. Cuando se intenta leer más allá de su origen (esto es, se intenta leer un elemento cuando está vacía) o cuando se intenta sobrepasar su capacidad de almacenar elementos, se produce un error: error por desbordamiento.