Fragen in Vorstellungsgesprächen in Dublin, Irland

I don't really remember about behavorial questions but I do remember about questions like "what was a project you think you've done well?", "what was a project you think you've done wrong?". I think that the behavior evaluation was mostly done during the lunch when you eat when someone from the team you'll work in if you get in. Design questions about networking were mostly about BGP and datacenter fabrics (which is something I was not good into, I work in an network operator environment). It was quite interesting to be honest but quite hard for me. My technical interviewers were looking for answers where you'll have to use both networking and system/coding solutions. The questions could never be answer only with networking skills (like how to load balance in 50/50 traffic between to upstream providers).

What was the networking phone screening focused on?

Mostly protocols such as BGP. One of the questions was "What is your favorite protocol?". This is not a simple question, actually I needed to explain why and had to get in a lot of details about the protocol that I mentioned. So choose wisely if you are asked this question.

Can you please let me know details for coding interview .. 1.how many questions ? 2.do we need to solve them or logic is enough ? 3. there main area of focus

I have my first round scheduled in June first week. Can you please help me out with the topics I need to cover?

i think the answer should be 18 million. the payoff of the option is 60m or 0. 60*0.3=18

Daneil, Why the payoff of the option is 60m or 0? I think the payoff is either 0 or 10M

9million. Your payoff if there is oil (30%) there is 100million - the 40million you soend -X(the amount you paid to check if there was oil). Then if you find no oil you wont buy it but you have already spent X to check. So spending X has a payoff equation: X=.3(100m-X)+.7(-X)

a vibrating alarm device creating a strong sensation to alert the person since their other sensory organs are sharper

I say you create an alarm clock that wakes up a person using a strong and pleasant smell

Always ask questions before answering. The Questions checklist is below 1. Problem being solved? (Understand the end user) 2. Understanding Tradeoffs- How many no. of users can decrease/ increase if a particular feature is introduced (implications) 3. Study 3C and P 4. Define metrics (Impact measurement) 5. Test and build- Prototypes- 6. Risks Involved 7. Assumptions being made?

alright - http://stackoverflow.com/questions/876293/fastest-algorithm-for-circle-shift-n-sized-array-for-m-position shiftArray( theArray, M ): size = len( theArray ) assert( size > M ) reverseArray( theArray, 0, size - 1 ) reverseArray( theArray, 0, M - 1 ) reverseArray( theArray, M, size - 1 ) O(n) with no extra storage. Wish I could have thought of that one myself...

I beieve this does the trick too: public static String shiftArray(char[] inputArray, int shiftLen) { assert(inputArray != null); int length = inputArray.length; assert(length > shiftLen); int moves = 0, from= 0, to = 0; char next, last; to = (from + shiftLen) % length; next = inputArray[from]; while(moves < inputArray.length) { last = inputArray[to]; inputArray[to] = next; next = last; from = to; to = (from + shiftLen) % length; moves++; } return String.valueOf(inputArray); }

I tried the above function - shiftArray and the looks is not working: shiftItemsFromList class: class shiftItemsFromList{ public static String shiftArray(char[] inputArray, int shiftLen) { assert(inputArray != null); int length = inputArray.length; assert(length > shiftLen); int moves = 0, from= 0, to = 0; char next, last; to = (from + shiftLen) % length; next = inputArray[from]; while(moves < inputArray.length) { last = inputArray[to]; inputArray[to] = next; next = last; from = to; to = (from + shiftLen) % length; moves++; } return String.valueOf(inputArray); } } Part of the main function: System.out.println("Circle Shift N size array for M possitions:"); char [] array = {'a', 'b', 'c', 'd', 'e', 'f'}; shiftItemsFromList sh = new shiftItemsFromList(); String s = sh.shiftArray(array, 2); System.out.println("Print the Circle Shift N size array: " + s); System.out.println("DONE"); OUTPUT: Circle Shift N size array for M possitions: Print the Circle Shift N size array: cbadaf DONE

There's no such thing as Brazilian Spanish. In Brazil the language spoken is Portuguese.

There's no such thing as Brazilian Spanish. In Brazil the language spoken is Portuguese.

As well as you deal with a n unproffesional named Barry Downes - greedy builder ,as well as you deal with HR sleepy heads, as well as you deal with supervisors hiring their relatives. In fact Affidea let go all good workers and kept others killing the business altogether. The devious Philip McCarthy just got rid of everybody working there as he was and still is an incompetent agent an envy person bulling staff and harassing the best ones as JK , AB, Colm,Amy, Chris, Anca and many more. An absolute frustrated individual looking for trouble.

Barry Downes and Brian McDermott are two most incompetent “professionals” you could ever meet. Playing people against each other and take no blame for teams that are falling apart. Absolute idiotic decisions are being made by builder and tyre salesman! Its frustrating to watch how such a complex business is being led by two clowns.

@Kevin How would you solve this if it didn't occur to you that it is a perfect squares problem? I would have to write a program to get the answer after the 4th or 5th guard.

I think the easiest way to think about it is that the guards are equivalent to factors of numbers. So for door 24 for example - the factors of 24 are 1, 2, 3, 4, 6, 8, 12 and 24 i.e. guards 1, 2, 3, 4, 6, 8, 12 and 24 are going to touch door 24, and no other guards. We know that guard one opens all the doors and the touching alternates open and closed after that so you have 1-open, 2-close, 3-open, 4-closed, 6-open, 8-closed, 12-open, 24-closed. We can generalize this formula - all door numbers with an even number of factors will be closed - because every second touch closes a door. All prime numbers are divisible only by themselves and one, so they only have 2 factors, which means all prime-numbered doors are closed. Most other numbers have an even number of factors as factors in this sense come in pairs - two numbers which, when multiplied together, give you the number in question. So when do numbers NOT have an even number of factors? The answer is when the number has factors which are the same i.e. perfect squares! Take 9 for example, the factor pairs are 1 x 9 and 3 x 3. Although we have two factor pairs we only have three distinct factors. Which translated to this problem means that guard 1 will open door 9, guard three will close door 9 and guard 9 will open door nine again. No other guard will touch door nine therefore 9 stays open. This holds true for all squares. The highest square lower than 1000 is 31^2 = 961. This means the door corresponding to every square between 1 and 1000 will remain open. Therefore 31 doors will remain open.