1) Given a start node and a target node descriptor for any tree (not necessarily binary), check if the target is on the direct path or a child of a node on the direct path from the start node to the root of the tree. You have the methods getParent, getChildren, and match(). 2) Implement a stack with the operations push, pop, peek.
General algorithms, data structures questions.
What is your availability?
What previous simulations and FEA software have you used?
Talk about your previous experiences and how they would relate to this job
Q2 How did we collect and process the data?
Pourquoi vous payer plus cher qu'un ingénieur débutant sous prétexte de 7 ans d'expérience, êtes-vous forcément plus productif ?
What was a project that challenged you>
STAR Method and couple technical questions that were not related to the job posting.
How do you deal with deadlines?
Viewing 381 - 390 interview questions