Candidatei-me por indicação de um funcionário. O processo levou 1 dia. Fui entrevistado pela Xilinx (San Jose, CA) em mai. de 2012
Entrevista
Basic graph and data structure questions. Some programming tests. The difficulty was at most medium. I think I had five rounds. Prepare questions like tell me your most interesting projects etc.
Perguntas de entrevista [1]
Pergunta 1
describe the shortest path of a graph with negative weights
Candidatei-me por indicação de um funcionário. O processo levou 1 dia. Fui entrevistado pela Xilinx (San Jose, CA) em out. de 2010
Entrevista
Phone interview was a general screening interview
Technical interviews covered - work experience, C++ & programming questions, Graph theory questions.
Perguntas de entrevista [1]
Pergunta 1
What is the minimum number of colors required to represent each state in a Country map such that no two adjacent states are represented by the same color
