# Automation Engineer Interview Questions

Automation engineer interview questions shared by candidates

## Top Interview Questions

### QA Automation Engineer at Workday was asked...

Do you believe automation is more important than manual QA? 2 AnswersI won't believe, both r important. we are doing documentation and writing test cases manually, then we are converting manual test cases into test scripts and executing them. It is the process of testing life cycle. Your question is somewhat vague. When it comes to service tests then automation is more important; When it comes to graphic design manual is more important. when it comes to regression tests automation is more important than manual testing. |

what automation tool you have been using for your last project 1 AnswerHP uft, LR, Selenium, badboy |

### QA Automation Engineer at BitTorrent was asked...

A dwarf-killing giant lines up 10 dwarfs from shortest to tallest. Each dwarf can see all the shortest dwarfs in front of him, but cannot see the dwarfs behind himself. The giant randomly puts a white or black hat on each dwarf. No dwarf can see their own hat. The giant tells all the dwarfs that he will ask each dwarf, starting with the tallest, for the color of his hat. If the dwarf answers incorrectly, the giant will kill the dwarf. Each dwarf can hear the previous answers, but cannot hear when a dwarf is killed. What strategy should be used to kill the fewest dwarfs, and what is the minimum number of dwarfs that can be saved with this strategy? 21 AnswersThere are 2 different strategies, each dependent on whether there are an even or odd number of white and black hats in play. The minimum number of dwarfs that can be saved with the correct strategy is 9. There is only one strategy, does not matter how many white or black hats they are. They are always 9 dwarfs that could be saved. You just have to know about XOR. Well... In my opinion all can be saved! The tallest dwarf can see 9 hats in front of him ( 4 white and 5 black hats or the other way around). Then he knows the color of his hat because there has to be 5black and 5 white hats. The next dwarf by the size just has to believe to the tallest dwarf that he is right-(and he is) In addition ,he can see 8 hats in front of him and when he adds the color of the tallest dwarf he knows which color he has. Again,the 3rd one in a row knows about 2 colors before and can see 7 colors in front of him.And when he adds 2 colors he already had heard of -he knows total number of 9 hats as well.So he just has to see which color is less presented and that is the color of his hat. And so on until the last dwarf...All saved Show More Responses the question does not mention that there will be equal number of white and black hats ! Since they do not know, how many black or white hats there are, the following strategy will save min 5 dwarfs: The first dwarf asked names the color of the hat of the 2. dwarf. He has a 50% chance that that's correct. Anyway, the second dwarf then knows, the color of his hat and names it correctly. the 3. dwarf again names the color of the hat of the 4th dwarf and has a 50% chance to survive, while the 4th dwarf can name the correct color of his hat. a.s.o. => all dwarfs with an even number will survive and all the others have a 50% chance Don't over-think it. Each dwarf simply has to state the color of the hat worn by the dwarf directly in front of him. The tallest would have to sacrifice himself in order to save the other 9. Easy. The tallest is the only one that cannot be saved so instead of trying to guess his color, he yells out a sequence of letters starting from the shortest like BWBBBWWBB. Next :) Your going to definitly get 9 because when the dwarves collude the tallest tells the next tallest his hat color and so on down the line. Now you have a 50/50 chance that the tallest will get his color correct and live so you have 9 with a 50% chance of 10 Each dwarf can state the color of the hat worn by the dwarf in front of him, but the thing is, that color may not be the color of his own hat.So he may be killed by the giant.In that case, as mentioned above all odds should tell the color of next so that all even number will be alive and they have 50% chance of surviving. Think broadband communication. Exploit the capabilities of the communications medium. A minimum of nine dwarves can be saved based on the information provided in the original post I viewed. The strategy is for each dwarf to employ the expected language to communicate the color of their own hat to the giant, while simultaneously employing a vocal pitch protocol to indicate the color of the hat of the dwarf in front of him, high pitch for white and low pitch for black. The original post, indicates the dwarves may collude prior to the distribution of hats, so there is opportunity to negotiate such a simple broadband communication protocol. The tallest dwarf only has a 50/50 chance since the number of black and white hats in play is not known (rhetorical question, what are the odds the tallest dwarf's hat is black if he turns to find that all nine hats in front of him are white? I don't know, but odds are high that the giant is a sadistic bloke). The original post I viewed is here. http://www.businessinsider.com/toughest-job-interview-questions-2013-7#a-dwarf-killing-giant-lines-up-10-dwarfs-from-shortest-to-tallest-each-dwarf-can-see-all-the-shortest-dwarfs-in-front-of-him-but-cannot-see-the-dwarfs-behind-himself-the-giant-randomly-puts-a-white-or-black-hat-on-each-dwarf-no-dwarf-can-see-their-own-hat-the-giant-tells-all-the-dwarfs-that-he-will-ask-each-dwarf-starting-with-the-tallest-for-the-color-of-his-hat-if-the-dwarf-answers-incorrectly-the-giant-will-kill-the-dwarf-each-dwarf-can-hear-the-previous-answers-but-cannot-hear-when-a-dwarf-is-killed-the-dwarves-are-given-an-opportunity-to-collude-before-the-hats-are-distributed-what-strategy-should-be-used-to-kill-the-fewest-dwarfs-and-what-is-the-minimum-number-of-dwarfs-that-can-be-saved-with-this-strategy-11 So reading the answers provided they all have some assumptions e.g. that there are as much white hats as there are black hats. I think that Christian's comment on aug 13-2013 was very close but I'm thinking about communication integrity confirmation techniques. One of them is using a parity bit to confirm the message was correct. This could be applied right here to save at least 9 with a 50/50 chance of saving the 10th (and tallest dwarf). I will explain it but for ease of explanation I will use binary 1 and 0 for black and white. Number 1 being black hat and number 0 being white hat. Let's say we got a (random) hat sequence of 0001011101 with the tallest dwarf on the right and the shortest on the left. While colluding prior to the distribution of hats the dwarfs agree upon even or uneven parity. This means the total amount of 1's (black hats) must be even or uneven including the parity bit. In this case the 10th dwarf will count as parity bit. So if we'll take an even parity, the number of 1's must be an even number in total. When the questioning starts the tallest dwarf will see the hats in front of him being 000101110. The tallest dwarf counts four 1's (black hats) so to make the parity even he has to say 0 (white hat). He will get killed but the dwarfs in front of him will know the parity bit is 0 so the 2nd tallest dwarf will see the hats in front of him as 00010111. He will also count 4 and knowing that the dwarf behind him said 0 he'll know that the total amount of 1's is an even number thus concluding he has a 0 (white hat) and will state he has a white hat. Same goes for the rest of the dwarfs and so 9 will be saved. The 10th would've been saved it the dwarfs agreed on an uneven parity. That's why there's a 50/50 chance the 10th will be saved. I'm pretty confident this is the answer but if you want to understand it better (maybe my explanation is a bit vague) go search for "parity bit" on the internet. @Kristen - you have so underthought it! What if the dwarf behind you says "black" and the dwarf in front of you has a white hat???? @JustJanek- Your solution is close, but not correct. Every dwarf needs to consider the parity of a number composed of all the following dwarfs and all the dwarfs behind. The first dwarf says the parity of the 9-bits number in front of him. Assuming that all the other dwarfs know the trick and they stay alive, each dwarf needs to compare the initial parity with the parity of an 8-bit number composed of the hats in front of him and the hats behind (assuming that the dwarfs behind gave the right answer), if the parity is the same, he knows that he has a white hat, otherwise he has a black hat. Show More Responses You can save 9 dwarves at least. Dwarves agree that the tallest one says he is wearing black hat if he sees odd number of black hats in front of him and he says white hat if he sees even number of black hats in front of him. So, the tallest one has 50-50 chance of survival and other dwarves survive 100%. What is the minimum number of dwarfs that can be saved with this strategy? 9 First of all, let's numerate the dwarfs as N1, N2, N3, etc. with N10 being the tallest. Now, N10 will state the color of N9 as his own answer, "My hat is WHITE". Based on this answer, N9 will state his color with a positive statement if the color of N8 is the same as his, "My hat is WHITE". Based on N8's answer, N8 knows that his color is WHITE, now, he will state his color depending on N7. Let's say N7 is black, so N8 will state, "My hat is NOT BLACK". N7 knows that his color is BLACK, but N6 is white, so he will use a negative statement, "My hat is NOT WHITE" and so on. Full example: N10 = BLACK N9 = WHITE N8 = WHITE N7 = BLACK N6 = WHITE N5 = WHITE N4 = WHITE N3 = BLACK N2 = BLACK N1 = WHITE N10: My hat is WHITE (Dies) N9 = My hat is WHITE N8 = My hat is NOT BLACK N7 = My hat is NOT WHITE N6 = My hat is WHITE N5 = My hat is WHITE N4 = My hat is NOT BLACK N3 = My hat is BLACK N2 = My hat is NOT WHITE N1 = My hat is WHITE N10 will have a 50/50 chances of survival... I'm sorry N10, I couldn't save you :'( What is the minimum number of dwarfs that can be saved with my strategy? - 10 My strategy doesn't make any unmentioned assumptions (such as equal number of white and black hats, etc). At the same time, it doesn't add any unmentioned constraints either. The strategy is simple to the point of appearing simplistic. But it meets all the requires. The strategy is: When asked, every dwarf answers "Not RED". This is not an incorrect answer and the Giant, if he were an honourable giant that is :), would have to let the Dwarf live. On a different page altogether, I went through all of the above answers. Not to sound patronizing, but some of the solutions were quite brilliant. I was thinking if I could even come up with that even after years of pondering. But I must admit, all of the above strategies are made by an outsider (ie. us) who is not impacted by this fate. Whereas in the casestudy, the strategy has to be devised by the 10 dwarfs, who face the impact of this strategy. Not to bring in factors such as emotion, the bell curve distribution of intelligence, and other such anal considerations. But I thought it was important to bring in Game Theory, and that all Dwarfs are rational, and that all rational people do not want to harm themselves in any way. In other words, when a strategy's success depends on the conformance to that strategy by ALL the participants, the strategy should also benefit ALL the participants if it is to succeed (or in the least, should not harm even ONE participant). In all the above strategies, since even in the best case scenario the poor Tallest Dwarf has only a 50% chance of living, can we assume that he would conform to this strategy? Each dwarf should pronounce color of hat of dwarf before him. This way they can save atleast 9 dwarf out 10. Well, Once the dwarfs are lined up in descending order. Without any kind of assumption, 9 people can be saved with a 50% probability of the 10th (tallest). Here is how it can be achieved, The strategy is to call the color of odd number of hat. Say for example, the tallest dwarf sees 3 Black and 6 whites, it will call out Black(it may or may not die with 50% chances). Now, the 9th tallest dwarf knows what the 10th dwarf could see and if it (9th) dwarf sees the same odd number of black hats, it will know it has white hat. Next, 8th dwarf knows number of odd (black) caps 9th dwarf could see and if it(8th) finds 1 less black cap, it would know it is wearing a black cap.. and so on. 10- White (calls out Black because it sees odd number of black hats) -dies(assume) 9- White (calls out White because it could still see 3 black hars) 8- Black (sees that there is one less black hat as mentioned by 9th, hence identifies that is wearing black) 7-White (calculates that 8th is wearing black and he could see 2 black, hence identifies itself wearing whiteO( 6-White 5-White 4- Black 3-Black 2-White 1-White Sorry if there is confusion in the way I have answered. all can b saved... They will exchange their hats in Circular form...person10 can see the person1 color of hat and after exchange every dwarf will tell color to their previous ones and person 10 knows the color before changing it from dwarf 1. d10->d9->d8->d7->d6->d5->d4->d3->d2->d1->d10 CIRCULAR EXCHANGE OF HATS First lets look at number of back and white hats...To satisfy the condition "black and white" hata there is minimum one black or white hat present. So its minimum (9 black & 1 white) or (1 white & 9 black) hat being distributed randomly amoung dwarfs. The story says dwarfs are alowed to speak before execution. Lets make a strategy of saying only one colour before execution eg) black or white. Minimum probability of (9 black & 1 white) hats and all the dwarfs say "white"...In this case one is saved but all nine dead. If all dwarfs say "black"..Nine are saved but one is dead. The same applies for the minimum probability of (1 black and 9 white)hats. Thus minimum one dwarf is saved and maximum nine dwarfs can be saved. If each dwarf say the colour of hat in front of him..(dwarf can hear previous answer) then at least five people are saved. |

### IOS UI Automation Engineer at Apple was asked...

Write a function that determines which function is a mirror number. i.e. 12321 would return YES 5 Answersfunction mirror(num){ len = num.length - 1; for(i=0; i<=len; i++){ if(num[i] == num[len - i]){ return YES; }else{ return NO; } } } function mirror(number){ number=number.toString(); length=number.length-1; for(i=0;i def mirror(num): li=list(num) length=len(li)-1 for i in range(length/2): if li[i]!=li[length-i]: print 'NO' return else: print 'YES' mirror('12321') mirror('12322') output - >>> YES NO >>> Show More Responses Using Python: def mirror(num): li = list(str(num)) length = len(li)-1 for i in range(length/2): if li[i] != li[length-i]: print 'NO' return print 'YES' mirror(12321) mirror(12341) Output >>> YES NO >>> JAVASCRIPT function mirror(num){ var a = []; var n = num.toString().split(""); for (var i= n.length - 1; i>=0; i--){ a.push(n[i]); } a = a.join(""); n = n.join(""); if (n == a){ return "YES"; } else{ return "NO"; } } mirror(12321); |

### QA Automation Engineer at BitTorrent was asked...

You have 2 identical crystal orbs and a 100 storey tall building. How do you determine which floor the orbs will shatter at, and what is the minimum number of tests you need to execute? 5 AnswersOne test. If they shatter, they will shatter at the bottom floor. =)D If this is supposed to be a "what's the worst case" sort of question -- Drop first at the 50th floor. If it shatters, work you way up from the first floor. If it does not, drop from the 75th floor. If it shatters, work up from 50th floor. It it does not, drop from the 88th floor. If it shatters, work up from the 75th floor. It it does not, drop from the 94th floor, etc. You can get it done in about 4-5 tests, I think. Start by dropping one from the 33rd and one from the 66th. If both shatter, it's a floor below 33. If 33 is intact and 66 shatters, then it's a floor between 33 and 66. If both remain intact, then you'll check floors above 66. For your next test, divide the range you need to investigate into 3. So, for example, if the 66th breaks and the 33rd does not, then you have 33 possible floors. 33 divided by 3 is 11, so go up 11 floors from 33 and down eleven floors from 66 and drop them. Same idea as last time- you're narrowing it down to 1/3rd of all of the possible floors. You'll know the correct floor at which they will break when the number of possible floors is exactly 1 percent of the number of original floors (in other words, when there is only 1 floor out of 100 that could be the lowest shattering floor). Since each test reduces the possible floors by 66% (leaving 1/3 of the previous floors remaining), you'll have one floor left when (1/3)^n = .01, where n is the number of trials. This occurs at log base 1/3 of .01, which wolfram alpha says is 4.19, so it would take at least 5 trials to get this narrowed down to a single floor. Show More Responses The problem here is that you only have two crystal orbs. If you had closer to 100, a strategy of beginning on the 50th floor and working up or down would work great. Unfortunately, if it breaks at 50, and then breaks at 25, you're out of orbs. You'll have to be cautious. You can start on 50. If it shatters at 50, though, you'll have to go to the second floor (assuming you can simply place the orb on the ground when on the first floor) and work your way up one at a time--because you've only got one orb left. If it doesn't shatter at 50, go to 75. If it shatters at 75, you have to go to 51 and work up one at a time, as, again, you only have one orb left. If it doesn't shatter at 75, go to 88, etc. The minimum number of tests is 2. Shatters at 50, shatters at 2. If you only have two orbs, use one to test and the second to confirm. starting from the bottom make your way to the top on steps of 3 floors. This is slightly better than n/3 (n/3 + 3) where n is 100 in this problem. For example: let's say the orbs break on the 48 floor. On increments of 3 you get to the 48 floor in 16 steps. Once the orb breaks go to floors down and throw the second orb. You know that the orb didn't break on the 45th floor. If it breaks on the 48th floor, it won't break on the 46th, or the 47th floor, when you throw the orb from the 48th floor again it will be confirmed. let's say the orbs break on the 49th floor. you know 48th checks, 51st will break the 1st floor. go to 49th if it breaks you can confirm 49th is the limit. let's say they break on the 50th floor. 48th checks, 51st doesn't. go to 49th, checks, 50 doesn't therefore 50th is the limit. |

Take a point on a surface. How do you know you're contained inside a box? 3 AnswersThe door plate reads Intel on it. I don't understand the question. Is this an arbitrary mathematical surface? A physical surface of a component? What kind of box are we talking about? check co-ordinate of location versus co-ordinates of box and make sure your location is within the box co-ordinates. |

How would you test an ATM machine 2 AnswersWith requirement specifications document 1. Machine is accepting ATM card 2. Machine is rejecting expired card 3. successful entry of PIN number 4. unsuccessful operation due to enter wrong PIN number 3 times 5. successful selection of language 6. successful selection of account type 7. unsuccessful operation due to invalid account type 8. successful selection of amount to be withdraw 9. successful withdrawal. 10. Expected message due to amount is greater than day limit 11. unsuccessful withdraw operation due to lack of money in ATM 12. Expected message due to amount to withdraw is greater than possible balance. 13. unsuccessful withdraw operation due to click cancel after insert card |

What do you like to do in your spare time? 1 AnswerExercise |

Limitation of number of pins on the input of a gate, even if it is FinFET where stacking effect is absent. 1 AnswerAs far as I can guess, it is because of pin to pitch density, but I may be wrong, too. |

What was your favorite class? 1 AnswerProcess dynamics |

**1**–

**10**of

**491**Interview Questions

## See Interview Questions for Similar Jobs

- QA Engineer
- Software Engineer
- Software QA Engineer
- Automation Engineer
- Senior Software Engineer
- Quality Assurance Engineer
- QA Analyst
- Senior QA Engineer
- Test Automation Engineer
- Software Developer
- Test Engineer
- Quality Assurance Analyst
- Software Test Engineer
- Senior QA Automation Engineer
- Software Quality Assurance Engineer
- Software Engineer In Test
- QA Tester
- Business Analyst
- Intern