Software developer/designer

 

1. There is a three-volume novel on the bookshelf, lined up in a nice row: Each volume has a thickness of 5cm. How many minutes will it take for a moth with a chewing speed of 1cm/min to eat its way through from the first page of Vol.1 to the last page of Vol.3.?
   Solution: 
2. In any language, make a programme to determine the highest common factor of two positive whole numbers, using an Euclydian algorithm. Mod division (modulus: mod) can be used as a base operation, not needing to be programmed.
   
   Aids in solving the problem:
   Mod division: The mod division of two numbers, a and b, results in the number that is the remainder after dividing a by b. E.g.: 18 divided by 5 results in 3 (that is, 18 mod 5 = 3)
   Euclydian algorithm: Perform the mod division of the two numbers. If the remainder is 0, then the divisor of the division is the highest common factor. If the remainder is not 0, then the previous divisor should be divided by the previous remainder. It can be mathematically proved that, sooner or later, the remainder will be 0. The last non-0 remainder is the highest common factor: it is the final result.
   Source of the solutions:
3. Translate the following text into Hungarian:
   Due to the fact that more than one modification can be executed by more than one user group, the content of the drop downs must be saved into a note field as well. Otherwise, the old information would be lost after each change.
   Translate:
   

Name:
E-mail:
CV file: