Fragen in Vorstellungsgesprächen in Region Dublin, Irland | Glassdoor.de

# Fragen in Vorstellungsgesprächen in Dublin, Irland

Vorstellungsgespräche bei Salesforce in Dublin

www.salesforce.com /  Hauptsitz: San Francisco, CA

426 Vorstellungsgespräche in Dublin (von 7.118)

3,3 Durchschn.

www.google.com /  Hauptsitz: Mountain View, CA

391 Vorstellungsgespräche in Dublin (von 12.157)

3,4 Schwer

Vorstellungsgespräche bei Accenture in Dublin

www.accenture.com /  Hauptsitz: Dublin

278 Vorstellungsgespräche in Dublin (von 15.569)

2,7 Durchschn.

## Fragen im Vorstellungsgespräch für in Dublin

Sortieren: RelevanzBeliebtheit Datum

### Ein Bewerber für eine Stelle als Adwords Associate bei Google wurde gefragt...

20. Apr. 2012
 What angle is between an hour and a minute arrows when time is 5:30?13 Antworten30 degreesI think you got that wrong bud, the answer should be 15 degrees.Yeah, you right man. 15 is correct.Mehr Antworten anzeigenWHY 15? I think it should be 30..15 degrees because at 5:30 the hour arrow is not at 5 but in the middle between the 5 and 615 degrees plus or minus 180 degrees. (who knows how accurate the clock is)45/3=15 15 is the correct answerit is 30 degree WHY 15 ?minTheta = 30*(360/60) = 180 hourTheta = 5*(360/12) + (360/12) * (30/60) = 165 so the difference is 15 degreeAssume a circle is 360° and you 60 grades reprsenting each one 1 minute. 360/6=6°, so 1 degree equals 1 minute At 5.30pm the arrow will be pointing at the third grade between 5 and 6 which means there are 2 left: 2*6=12° is the accurate answer ;)No, at 5:30 the arrow will be pointing in the middle between the second and third grade = therefore its 2.5*6 = 15... or 30/2 = 15 !the correct answer is 15 degree right?I don't get your complicated formula... a full circle is 360 degree so a quarter of it, equal to 90 degrees. From 3-6 separated to three equal correspondent angles by 4 and 5 so 90/3 = 30 degree (clockwise) then 360 - 30 =330 degree (anticlockwise)

19. Nov. 2017

### Ein Bewerber für eine Stelle als Quantitative Research Associate bei Susquehanna International Group (SIG) wurde gefragt...

2. Juni 2013
 toss 100 coins, what is the probability of getting more than 60 heads?7 Antwortenuse normal dist to estimate binary dist, but notice the tailbinomial distribution (100 60) (1/2)^60 (1/2)^40100 C 60 (0.5)^100 will get one prob of 60 heads, not 60 and above. Interview candidate is correct. You will most likely have to use normal dist. to estimate the binom dist given time constraints. A google search can inform one how to do thisMehr Antworten anzeigensimply use CLTdon't have latex installed, so sorry in advance. answer is: sum[i=60 to i=100] of (100 choose i)/(2^100)As pointed out, use a normal approximation for the sum. Define an RV called X. X = 0 for tails. X = 1 for heads. We have: E[X] = 1/2, Var[X] = 1/4. Now denote S = sum(X), where the sum runs over 100 realizations. So: E[S] = 50, Var[S] = 25. (The event are uncorrelated, so their covariance is zero, hence we can just sum variances here.) Then P(S >= 60) corresponds to P ( (S - 50)/sqrt(25) >= (60 - 50) / sqrt(25)). Note that we just subtracted the mean and divided by the standard deviation. This renders the term at the LHS a standard normal variable. So we need: P(N >= 2), where N is standard normal. If no computer is allowed, one can remember that the 97.5% percentile lies at 1.96. (If you often compute two-sided 95% confidence intervals, then you might know this number.) Or remember that within 2 sigma of the mean, 95 percent of the realizations lie. Since the distribution is symmetric, you will come to the same conclusion. So we estimate: P(S > 60) = 2.5%. In summary: make two approximations: one for going from Binomial to Normal, and a second for estimating the probability.Using the normal approximation to a binomial distribution... Find the z value (i.e. z=x-u/st) u=mean u=np=100x0.5=50 st=standard deviation st=sq(npq)=sq(100x0.5x0.5)=5 x= 60-0.5=59.5 (i.e. continuity correction) z=59.5-50/5=1.9 Therefore P(x≥ 60)=P(z≥ 1.9)= 1-P(z≤1.9)= 1- 0.9713=0.0287 Answer: 2.87 % chance of getting more than 60 heads

### Ein Bewerber für eine Stelle als Assistant Trader bei Susquehanna International Group (SIG) wurde gefragt...

13. März 2013
 A piece of land has a 30% chance of being located over an oil reserve, in which case it is going to be worth 100M. If there is no oil, the land is worth 30M. You are offered an option to buy the land at 40M after inspecting it and ascertaining if there is oil. How much are you willing to pay for this option?6 AntwortenThis is a very basic options question, of course. Not being too familiar with options, I did not follow that until it was too late and the interviewer had corrected me. They mislead you slightly by first asking you for the fair value of the piece of land and by asking the question in a fairly convoluted way.20 MillionExpected value = 0.3(100m) + 0.7(30m) = 30m + 21m = 51m => option price = 51m - 40m = 11m No?Mehr Antworten anzeigeni think the answer should be 18 million. the payoff of the option is 60m or 0. 60*0.3=18Daneil, Why the payoff of the option is 60m or 0? I think the payoff is either 0 or 10M9million. 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)

### Ein Bewerber für eine Stelle als Project Manager bei Microsoft wurde gefragt...

21. März 2012
 How would you design an alarm clock for people who are deaf and blind at the same time?6 AntwortenI proposed using water sprinklers or a bed that elevates the upper part to wake up its userthat's a good answer but there are some previous question that must be asked to extract the most information available. questions like: target age? what about people living those people? how they are going to set the alarm, etc. in other word don't assume anythinga vibrating alarm device creating a strong sensation to alert the person since their other sensory organs are sharperMehr Antworten anzeigena vibrating alarm device creating a strong sensation to alert the person since their other sensory organs are sharperI say you create an alarm clock that wakes up a person using a strong and pleasant smellAlways 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?

### Ein Bewerber für eine Stelle als Software Engineer bei Amazon wurde gefragt...

28. Dez. 2010
 you have array with n elements. How would you do circular shift of k positions? Time and space complexity?6 AntwortenMake a circular linklist, and move headpointer K position to do K shifts. It's O(n) time complexity. Space is contant. (circular link list).Well, space isn't constant because you took an array and then copied it somehow to a linked list. Remember, you were given an array? If I understand the question correctly, they're asking to do a circular shift of some range of values, like the first k values in an array of length n? So if you wanted to shift right, temp = array[k] from index=k to 1 array[index] = array[index-1] array[0] = temp this would be O(k)? I mean, it would take k steps, but maybe it's somehow still O(n)oh, sorry, I misunderstood. Not k values, move everything k positions. Praveen Chettypally's answer works but the space complexity would be O(n) since there is a fully copy of the list? The simplest would probably be to make another array and copy in, starting at the (n-k)th element, going to the end, then starting at the beginning. A second array would probably be a better option than a completely different data structure. What if it has to be done in place? is there an O(n) solution?Mehr Antworten anzeigenalright - 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

### Ein Bewerber für eine Stelle als Customer Services bei LinkedIn wurde gefragt...

13. Sept. 2010
 What is the difference from Brazilian Spanish and Spanish from Spain?5 AntwortenKills me to hear this kind of question in 2010 with Internet available to anyone, coming from a HR manager.They speak Portuguese in Brazil.Brazilian Spanish is the new PortugueseMehr Antworten anzeigenThere'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.

### Ein Bewerber für eine Stelle als Appointment Centre Manager bei Affidea wurde gefragt...

5. Dez. 2017
 How do you deal with unmotivated staff?5 AntwortenHow do you deal with conflict?As well as you deal with unprofessional management that promoted nepotism whitin the company. A deep outlook at the company indicates that employee offered jobs in there are all related or friends. Once you have a team like that you are obstructed to take any action - so you can not motivate. Stupid question asked but well done you made up your mind to searching for a better job. Absolutelly, a company with no respect for employee.Let them go- simple- They will become motivated once they fear low of job 🤣Mehr Antworten anzeigenAs 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.

### Ein Bewerber für eine Stelle als Assistant Trader bei Susquehanna International Group (SIG) wurde gefragt...

22. Juli 2015
 Every morning, Mike the security guard at CP high school opens all 1000 doors in the building. Let's assume the doors are numbered 1-1000. The next security guard closes all even numbered doors. The third security guard touches all doors that are multiples of 3. If a door is open, he'll close it and vice versa. The fourth guard changes the position of every fourth door (if it's open he'll close it etc.,) and the fifth guard changes the position of every fifth door and so on, until the 1000th guard changes only door 1000. HOW MANY DOORS ARE LEFT OPEN IN THE END?5 AntwortenYou can Google the answer.There will be 31 doors left. This question is basically asking how many perfect squares there are between 1-1000.@Kevin 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.Mehr Antworten anzeigen@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.

### Ein Bewerber für eine Stelle als Analyst bei Google wurde gefragt...

12. März 2016
 Which type of different scam or fraud can affect youtube raking?4 Antwortendeceptive contentCan you please provide more examples of the questions asked in the interview?Buying likes/thumbs up to give perception of a very popular videoMehr Antworten anzeigen1. Automated Click through rate via a bot on ads on you tube- Click fraud 2. Posting illegal or deceptive content on the you tube without proper license & proprietary rights.
110 von 14,202 Fragen im Vorstellungsgespräch