Fragen im Bewerbungsgespräch: Software engineer in Region Raleigh, Vereinigte Staaten von Amerika | Glassdoor.de

# Fragen im Vorstellungsgespräch: Software engineer in Raleigh, Vereinigte Staaten von Amerika

809

Fragen aus Vorstellungsgesprächen für software engineer, von Bewerbern geteilt

## Top Vorstellungsgespräch-Fragen

Sortieren: RelevanzBeliebtheit Datum

### Ein Bewerber für eine Stelle als Senior Applications Developer bei Deutsche Bank wurde gefragt...

14. Feb. 2011
 We have a pond containing a single bacterium. The number of bacteria double every 5 minutes, and the pond is full of them in 24 hours. If we started with the same pond but two bacteria, how long will it take to fill the pond?4 AntwortenI struggled with this a bit and got close. I believe answer is: 23:55This is a clear case of Geometric progression. Find the nth term Tn1 = a*r^(n-1). where n = (24 * 60)/5,a = 1 and r=2. when the initial value (a) = 2, the values become n = ?, a = 2 and r = 2. Since Tn1 = Tn2, Equate the RHS of both the equation. Since the base are equal, equate the powers, doing so will give the n value. When n is convert into minutes one get 23 hrs 55 minutes.this is easy, you don't need all the math. The pond was half full five minutes before, so it's 23:55Mehr Antworten anzeigenThe first pond started with 1 bacterium and doubled to 2 in five minutes. Therefore, the second pond will take 5 minutes less than the first to be full. ie: 23:55

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

13. Dez. 2012
 Two trains, each moving at 20 miles per hour towards each other, are initially 60 miles apart. A bee starts at the front of one train, flies to the other train, then back to the first train, and so on. If the bee always flies at 30 miles per hour, how far does the bee fly before the trains collide?6 Antworten45 miles. He was laid back about this question and wanted to see me thinking about it more than getting it right.time of collision=30/20=1.5hr distance fly by the bee= 30X1.5= 45miles45 miles is the wrong answer. The end points for the bee are constantly changing, so you can't just say 30X1.5Mehr Antworten anzeigen@72min ..the bee collides with first train and starts traveling back @30miles/hour...when trains are 6 miles apart from collision point.. @90 min the collision occurs...so bee has 18min to travel from its collision in opposite direction...so 30mph * 18/60 = 9 miles towards collsion point(which is 6 miles apart). So it will be far by 3 miles.So the distance covered by both train in an hour is 40miles, to complete whole distance 1.5 hr required. and bee flies 45 miles in 1.5 hr. Ans: 45 miles Einer oder mehrere Kommentare wurden entfernt. Weitere Informationen finden Sie in unserem Verhaltenskodex und in unseren Nutzungsbedingungen.

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

26. Okt. 2010
 Write C code to check if an integer is a power of 2 or not in a single line?5 Antwortenif( x & (x-1) == 0) { printf("Power of 2); }int isPowerOf2 = (i & 0x1) ? 0 : 1;Answer of Nov 9, 2010 is inappropriate. i=6 fails this code.Mehr Antworten anzeigenreturn !(x&(x-1)); returns "1" if x is power 2, returns "0" if x is not power of 2@SomeElse His code just checks if the number is even or odd.

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

3. Apr. 2010
 find number of 1's in a number4 Antwortenuse bitwise operator.while(number) { if(number & 0x01) count++; number=number >> 1; }int count1(int n) { int result=0; while(n&=(n-1)) result++; return ++result; } Complexity is O(m) where m is number of ones (NOT number of bits).Mehr Antworten anzeigenFirst check if number is 0, if so return 0, else do the above function

### Ein Bewerber für eine Stelle als Software Engineer New Grad bei Microsoft wurde gefragt...

12. März 2013
 He asked me to write a function to detect whether string1 contains all letters in string24 Antworten// Assume S1 and S2 are non-null pointers bool hasChar(char *s1, char *s2) { int ret=false; char *tmp; if (*s2 == '\0') return true; tmp = s1; while ((*tmp != '\0') && (*tmp != *s2)) tmp++ if (*tmp == '\0') return false; return hasChar(s1, s2++); }Traverse string2 and create a map where the characters of string2 are used as keys. Then traverse string1. If the the character in string1 exists in the map, remove the key from the map. At the end if your map has anything in it, string1 did not contain all of the characters.private static bool isEqual(string s1, string s2) { int[] first = new int[26]; int[] second = new int[26]; for (int i = 0; i 0) return false; } return true; }Mehr Antworten anzeigendef hasAllLetters(str1,str2): if str2 == "": return True else: dict = {} for ch2 in str2: if ch2 in dict: dict[ch2] += 1 else: dict[ch2] = 1 for ch1 in str1: if ch1 in dict: if dict[ch1] > 0: dict[ch1] -= 1 else: del dict[ch1] else: return False return True

### Ein Bewerber für eine Stelle als Senior Software Engineer bei Ericsson-Worldwide wurde gefragt...

24. März 2009
 I had not expected to be asked logic questions, which made me nervous. The first one was a weigh nine items on a balancing scale to find the odd one out in the fewest scale uses4 AntwortenSplit them into three groups of three, weigh two to determine the odd set out, then split that stack of three into three sets of one, and weigh two to find the single one out, requiring only two scale uses.The above strategy works only if you know whether the odd item is lighter or heavier. If you do not know how it differs, you will need more scale uses.111-111-114 <--- By weighing any of two sets, you get 114. 1-1-4 <----- By weighing any of two, you can find out 4.Mehr Antworten anzeigenIn these sorts of interviews you really need to drill down and understand what the interviewer is looking for. A good way to simulate a real interview experience is to do a mock with one of the Ericsson Senior Software Engineer experts on Prepfully, rated super strongly on TrustPilot... prepfully.com/practice-interviews

### Ein Bewerber für eine Stelle als Senior Applications Developer bei Deutsche Bank wurde gefragt...

14. Feb. 2011
 There are 10 stacks of 10 coins each. 9 of the stacks contain coins that weigh 1g each. The other stack contains coins of 2g each. The coins look the same. We have a scale that we can get a measurement of grams from, not a balance. We can use the scale exactly once to weigh anything here from a single coin to all of them. How can we determine which stack is the 2g coins?4 AntwortenWeigh these together: 10 coins from stack 1, 9 from stack 2, etc ending with 1 from stack 10. The weight of these will tell you which stack has the 2g coins. Ex: if it's 1st stack: 65g, 2nd: 64g, 10th: 54gExcellent question!A more eloquent answer would be: Weigh together 1 coin from stack 1, 2 coins from stack2, 3 coins from stack 3, etc. Subtract 55 from that total weight to get the number of the stack with the 2g coins.Mehr Antworten anzeigenBinary sort 1. Use single coin (I'd drop my stacks *s*) from each stack. Mark them by stack. 2. Place 5 each on both scales; note lower scale. 3. Place 2 coins on each scale, keep one aside; note scale. 4. If scales are at same level the coin NOT on the scale indicates the stack with heavier coins. Done. 5. If one scale is lower place 1 coin on each scale, note lower, identify stack. Done.

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

24. Apr. 2018
 Brain teaser #1: Given 8 balls and a balance, how many weighings would it take to find one ball that does not weigh the same as the other 7. Brain teaser #2: Two boys enter a tunnel. When they are 1/3 of the way through, they hear a train coming. If the boys run in opposite directions at the same speed, and narrowly miss getting hit by the train at their respective end of the tunnel, how fast was the train traveling compared to the 2 boys?3 AntwortenThe answers to these brain teasers can be found in numerous places on the internet.1st: 4 2nd: Not Possible2nd: Train is 3 times faster than boys.

### Ein Bewerber für eine Stelle als .NET Developer bei HCL Technologies wurde gefragt...

7. Juli 2011
 what is session management.3 Antwortenmaintaining a state is session management.Session management is a way in ASP.net to ensure that information is passed over from one page to the other. The view state property of a page is used to automatically pass the information of controls from one page to the other. The 'Session' object is used to store and retrieve specific values within a web page.Session management is a way in ASP.net to ensure that information is passed over from one page to the other. The view state property of a page is used to automatically pass the information of controls from one page to the other. The 'Session' object is used to store and retrieve specific values within a web page.

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

16. Okt. 2017
 Given the root of a tree and a target node, find the cousins of the target node (those that are on the same level as the target node, but do not share the same parent).4 AntwortenGtgjkk jhuhg fvyalfkal;kfja;lkfjalkdfjalkfd;lakjds;flkaj;sdlfkja;lksdfMehr Antworten anzeigenlkkalkfjdslkajdsflkadslkfjalksdfadsklflakdflka;lfdka;lkdf;alkf;lka;flka;lkfdalkfoewioifqjweoiifo;kavnsndfjansfjanlskdflaksjdflka;lwkrfowiefo;aofno;eri;oqngoengoeqnjgolvn;erngvjq a;oqnre;oiq;oitoq;n gqreoqi;oiqt;n g;qoenin gqntqo;rn oqwjr;qrewnqwer;uqwroiqwerqwrekqjjroi23oioi8989 Einer oder mehrere Kommentare wurden entfernt. Weitere Informationen finden Sie in unserem Verhaltenskodex und in unseren Nutzungsbedingungen.
110 von 809 Fragen im Vorstellungsgespräch