Candidatei-me por meio de uma faculdade ou universidade. O processo levou 2 semanas. Fui entrevistado pela FIS em out. de 2015
Entrevista
I interviewed for the GT.M project in FIS Global. Round 1 involved compiling and running a GT.M database. I was given access to source code. I had to use a Unix based system to compile it. Round 2 involved technical interview with a senior programmer. The job description mentioned the importance of the knowledge of DataStructures and Algorithms. That should have been my first clue.
Perguntas de entrevista [5]
Pergunta 1
When will you Compiler. When will you pick Interpreter.
What are the types of tree traversals? Why do we have so many tree traversals.
Under what circumstances will you use Hash values and binary search. Compare their performance. How will you handle the Hashmap if it results in a lot of Collisions
Consider a scenario where multiple processes are accessing a read-only memory. How will it work? Now, the processes are accessing write-able memory. How will it work? What locking mechanism will be used. How does compare and swap work
