Questions d'entretien pour Associate Engineer
25 k
question(s) d'entretien pour Associate Engineer partagée(s) par les candidatsPrincipales questions d'entretien
there are 8 bottles, 1 of them is defective. you are given a weighing machine and you are only allowed to weigh twice, how will you identify which bottle is the defective one
3 réponses↳
select 6 bottles weight 3 on each side 1)both weigh same weight then none is defective defect lies in another 2 weigh them to get the answer 2)if different weight take 3 which are of less weight compare only any 2 of them if both weigh same other one is defect if one of them weigh less then it is the defect one Moins
↳
It's not mentioned that the defective bottle weights less than the non defective
↳
It sholud not be less, but of equal weight.
Class, object, polymorphism, inheritance, encapsulation, interrupts, multi threading, try-throw-catch concepts, call by value, reference, pointers, semaphore, mutex, SRS, SDLC, stack, linkedlists, trees, OSI stack, TCP/IP, networking protocols. Go through job description and prepare accordingly.
3 réponses↳
For which position it was ? Was it for a senior position or an entry level?
↳
No
↳
Entry level
I am from ECE. They asked me why d u want to join an IT company as u r from ece.
2 réponses↳
during my graduation i realized.., that i cant get the groth in this field.., so i decided to switch my path from ece to IT. Moins
↳
in PI, dont set ur goals too high (as MS or big money).
The interviewer asked me from my Resume only whatever I had written.He asked about my project and some basic questions from Java.
3 réponses↳
Hi. what ques in second written test ??
↳
What does the second round comprise of? The English assessment?
↳
How was the 1st round interview and how to prepare for business communication test ?.I have interview in IBM on sep 11 Moins
If you have a 5 gallon jug and a 3 gallon jug how do you get exactly 4 gallons?
2 réponses↳
Fill the 3 gallon. Pour into the 5. Fill the 3 gallon again, pour into the 5. You now have a full 5 gallons and 1 gallon left in the 3 gallon. Dump the 5 gallon out. Pour the one gallon into the 5 gallon. Fill the 3 gallon and pour into the 5. You now have 4 gallons in the 5 gallon jug. Moins
↳
Fill the 5 gallon jug and transfer the 3 gallon to 3 gallon jug, what remains in 5 gallon is 2 gallons . Collect this 2 gallon. repeat the same to collect another two gallon. Add the 2 gallon(collected)+ 2 gallon (later) = 4 gallon Moins
Questions were based on HDL programming, which was totally unexpected, considering that it was for a software position
3 réponses
Explain bernoulis principle with formulas
2 réponses↳
When water flows continuously in a pipe, the amount of water flowing past any given section of the pipe is the same as the amount that flows past any other section of the same pipe. This is true whether the pipe widens or narrows. As a consequence of continuous flow, the water will slow down in the wide parts and speed up in the narrow parts. Daniel Bernoulli found that the pressure at the walls of the pipes decreases when the speed of the water increases. Bernoulli's Equation tells us how much the pressure within a moving fluid increases or decreases as the speed of the fluid changes. Here is Bernoulli's equation: Pa+1/2pv2a+pgha=Pb+1/2pv2b+phgb where is the first point along the pipe is the second point along the pipe is static pressure in newtons per meter squared is density in kilograms per meter cubed is velocity in meters per second is gravitational acceleration in meters per second squared is height in meters Moins
↳
i gravitational acceleration in meters per second squared
- They say they are language agnostic but well... - Java shop! Know your Java and patterns in and out! - Basic basic data structure implementation - Mostly Java questions and Java design questions - No algorithms unlike other mainstream companies. - Little bit of database in the phone screen.
3 réponses↳
I am primarily a C++ based Software Engineer. It has been a while since I coded in Java but I do write algorithms in Java. Most companies I interview with are truly language agnostic and mostly ask algorithms and data structures. Moins
↳
Another great piece of content from Rooftop Slushie: bit.ly/faang100
↳
There's a lot of elements to typically cover in these questions, clarifications, scoping, making sure you're answering the actual question the interviewer is looking for you to answer, etc. Could be worth doing a mock interview with one of the Prepfully LendingClub Associate Software Engineer experts... they've worked in the role so they clearly know how to get through the interview. prepfully.com/practice-interviews Moins
You work in a factory that manufactures balls. One day one of the balls manufactured in a group of eight is slightly heavier than the rest. You have a standard scale with which you can weigh the balls. How would you go about finding the defective ball in the least amount of weighing attempts possible (maximum of 2 attempts).
3 réponses↳
The solution is fairly simple. Divide the balls into three groups (3,3,2). Weigh the two groups of three first to see if the ball is in one of those groups. If it is then weigh two of the balls from the group it was in, which will tell you which ball was the heavier ball. If it's not in the groups of three then the ball is one of the remaining two. Weigh them to determine which one it is. The interviewer will likely ask how you would do this for a larger group of balls, say 80. The solution doesn't change, still divide the balls into three groups and go from there. Moins
↳
wrong - you used the scales at least four times . Use binary search as follows: Step 1: Divide into two groups of 4 balls, A and B. Weigh set A. If set A is correct weight, then set B is the "heavy set", else set A is the heavy set. Step 2: Divide the heavy set into two sets of 2 balls. Weigh one set of two balls. If correct weight, then the other two balls are the "heavy set" Step 3: Weigh one of the two balls. If heavy, then done. If not heavy, then the other ball is the heavy one. This is 3 uses of the scale, minimum possible attempts is "n" where 2 to the n is first power of 2 larger than or equal to the number of balls. For 80 balls, the answer is 7. Moins
↳
The question states a maximum of 2 attempts to weigh. The correct solution doesn't involve a binary search, but rather something closer to a ternary search approach as follows: Divide the 8 balls into 3 groups: A=3 B=3 C=2 Then next step is to weigh group A and B. If A is heavier than B, then A contains the heavy ball and we can eliminate groups B and C. This is weight attempt #1. So, take 2 of the balls from group A (A1 and A2) and weigh them (weight attempt #2). Obviously, if A1 or A2 is heavier, then you've found the heaviest ball. If they both weigh the same, then the ball not weighed (A3) is the heaviest. The same logic as above applies to find the heavy ball if group B was heavier than A since there are also only 3 balls in the B group. If A weighs the same as B, then group C must contain the heavy ball. Of course, since there are only 2 balls in C, you only need to weigh both to find the heavy ball. . Moins
Merge 2 sorted lists
3 réponses↳
Hi! Quick question, were you required specifically to use Java only for the coding questions? Or were you able to choose any language (e.g. python) ?? Moins
↳
I don't remember sorry. It was defaulted at JAVA, and the company does most of their work in JAVA anyway. JAVA is my best language so I really didn't pay attention to any other options, sorry. Good luck. Moins
↳
you can find the answer on google, it's a pretty easy question.