Technical Test

This test is designed to be as language neutral as possible. Any programming questions can be answered in the language of your choice, as long as you state which language you are using at the start of the question. 1. Write a function that takes two binary inputs and behaves in the following way: Input Input Input Input 0,0 0,1 1,0 1,1 Output Output Output Output 1 1 0 1

2. How would you sort an array containing the following integers? (11, 4, 7, 14) How would you generalise this for an array of length N? 3. Prime numbers are divisible only by themselves and 1. Given a number N, write a routine to determine whether N is prime or not. 4. You are asked to design a new file system. What elements would you consider to be fundamental to it? Give a brief explanation of your solution. 5. You are handed the source code of a malfunctioning application written in a language you have never used and told that in two weeks you are to become the sole point of support. How would you spend those two weeks? 6. You have an array containing the numbers 1 to 1,000,000. One number is duplicated in the array (e.g. 345645 occurs twice). How would you find out which number was duplicated in the most efficient way possible? How would you generalise this for an array of length N? What if instead of one number being duplicated in the array, one was missing from it? 7. Write an algorithm to determine the square root of N in the fastest way possible. 8. You are writing a web application that contains a lot of sensitive data. How would you secure access and make sure that the data contained in the database was only accessible to authorised users?