Posisi : Web Developer atau Mobile Developer (IOS atau Android) Concept Problems: 1. Make a Battlewizard class that combines both the Magic from Wizard class and Rage from Warrior class, all the following classes are derivatives of Hero class having Health and Mana attributes. You can use any programming language that you are familiar with. 2. Develop a normalized database structure (in the format of SQL CREATE TABLE queries) for a simple address book system. The database will record the first names, last names, addresses and phone numbers of the people in the address book. A person can have multiple addresses/phone numbers, conversely an address/phone number can be shared by multiple persons.

Logic Problems: 1. Make a function BinaryConv(), which takes N (a decimal number) as its parameter and return the binary conversion of N. Constraints : 0 â&#x2030;¤ N â&#x2030;¤ 1000000. Sample Test Cases: Input #00: 9 Output #00: 1001 Input #01: 123 Output #01: 1111011 2. It's QEON Festival Day and you have a schedule of events: 9:00 9:30 9:50 10:00 10:10 10:15 10:30 10:30 10:45 10:55 11:00

-

9:45 10:00 10:15 10:30 10:25 10:45 10:55 11:00 11:30 11:25 11:15

Cherrybelle Show Short Movie Theater Shadow Company Express Hack-a-Thon Math Quiz Heva Online Qeon Inside Programming Tutorial Gangnam Style Dance Cosplay Show Bouncity Door Prize

Naturally, you want to attend as many events as you can. What is the largest set of nonoverlapping events, if you can't leave any event you attend before the event ends? 3. A complement of a number is defined as inversion (if the bit value = 0,

Send your CV and answer to the following email address {base64 decoding of ZGV2QHFlb24uY28uaWQ=}, Subject QeonHiringQ412, before Jan 1 st 2012.

change it to 1 and vice-versa) of all bits of the number, starting from the leftmost bit that is set to 1. For example, if N = 5 then N is 101 in binary. The complement of N is 010, which is 2 in decimal. Similarly if N = 50, then complement of N is 13 Complete the function getIntegerComplement(). This function takes N as it’s parameter. The function should return the complement of N. Constraints : 0 ≤ N ≤ 100000. Sample Test Cases: Input #00: 50 Output #00: 13 Explanation: 50 in binary form equals 110010. Inverting the bit sequence yields 001101, which is 13 in decimal. Input #01: 100 Output #01: 27 Explanation: The bit sequence for 100 equals 1100100. By inverting the sequence we get 0011011, which is 27 in decimal. 4. Greatest common divisor (GCD) of two integers is the largest positive integer that divides both numbers without a remainder. For example, the GCD of 8 and 12 is 4. Make a function gcd(), which takes two integers A and B and return the GCD of these two numbers. Constraints : 0 ≤ A, B ≤ 1000000. Sample Test Cases: Input #00: 48 180 Output #00: 12 Input #01: 123 456 Output #01: 3

Send your CV and answer to the following email address {base64 decoding of ZGV2QHFlb24uY28uaWQ=}, Subject QeonHiringQ412, before Jan 1 st 2012.

5. How many possible ways are there to build the “QEON” word starting from the central square (the 'Q' letter), by moving to adjacent squares (vertical or horizontal) to form the next letters of the word?

Optional Problems: 1. Magic Squares A magic square of order N (3 ≤ N ≤ 100) is a N × N square containing different numbers between 1 and N² (inclusive), where all rows/columns/diagonals of the square have identical sum (that we will refer as the “magic constant” from now on). For example, the magic square of order 3 below has a magic constant of 15, because the all of its rows/columns/diagonals has the sum of 15. 4 9 5 16

14 7 11 2

15 6 10 3

1 12 8 13

Order = 4, magic constant = 34 Order = 3, magic constant = 15

17 23 4 10 11

24 5 6 12 18

1 7 13 19 25

8 14 20 21 2

15 16 22 3 9

Order = 5, magic constant = 65

The magic constant is only dependent on the magic square's order – it is identical for all magic squares with equal order. Given N, calculate the magic constant of an order N magic square. Input Input begins with a line containing an integer T, that denotes the number of test cases Each test case will contain an integer N (3 ≤ N ≤ 100) which denotes the order of the magic square for that particular test case. Output The output will contain exactly T lines (one line per test case), each containing an integer (the magic constant for the magic square order for that test case).

Send your CV and answer to the following email address {base64 decoding of ZGV2QHFlb24uY28uaWQ=}, Subject QeonHiringQ412, before Jan 1 st 2012.

Sample input

Output for sample input

3 4 5

15 34 65

Make a Battlewizard class that combines both the magic ability from Wizard class and rage from Warrior class, all the following classes are derivatives of Hero class having Health and Mana attributes. You can use any programming language that you are familiar with. 2. Order of primeness Consider the sequence of natural numbers: S0 = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, …} If we extract all prime-numbered term of the sequence (p-th natural number where p is a prime number), we’ll get a sequence of prime numbers (prime-th natural number): S1 = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, …} By repeating this process on the resulting sequence, a sequence of order-2 primes (prime-th prime number) is obtained: S 2 = {3, 5, 11, 17, 31, 41, 59, 67, 83, …} The order-3 primes (prime-th order-2 prime number) is obtained by repeating the same process on order-2 primes: S3 = {5, 11, 31, 59, …}, and so on. Let the order of primeness F(p) of a number p to be the highest order of sequence that p appears in. For example: • 2 is a prime of order 1 (F(2) = 1), since 2 appears in the sequence of (order-1) primes but not in the sequence of order-2 primes. • 17 is a prime of order 2 (F(17) = 2), since 17 appears in the sequence of order-2 primes but not in the sequence of order-3 primes. In this regard, any composite number can be said to have a primeness of zero since they does not appear in any sequence of prime numbers. Given a number N, output the order of primeness F(N) for that number. Input The input consists of several cases (each in a single line), where each case contains an integer N (1 ≤ N ≤ 1000000). Input is terminated by a line where the value of N equals zero. Output For each test case, output the order of primeness F(N) for the number N.

Sample Input 2 17 456 72727 52711 0

Output for Sample Input 1 2 0 5 9

Send your CV and answer to the following email address {base64 decoding of ZGV2QHFlb24uY28uaWQ=}, Subject QeonHiringQ412, before Jan 1 st 2012.

Web developer