Me postulé en línea. El proceso tomó 1 semana. Acudí a una entrevista en National Instruments en sep 2017
Oferta aceptada
Experiencia positiva
Entrevista fácil
Solicitud
Me postulé a través de una facultad o universidad. El proceso tomó 2 semanas. Acudí a una entrevista en National Instruments (Austin, TX) en mar 2016
Entrevista
The interview was mainly composed of behavioral questions. Mainly what they are looking for is your thought process and how you work with others. At the end they gave me a coding question which was to write code in whichever language you prefer to find the height of a tree.
Preguntas de entrevista [1]
Pregunta 1
Q: Describe a bug you've encountered and the steps you took to fix it?
I submitted an online application and they were able to give me an interview soon. They were very nice and there were some technical questions on data structures. Specifically with binary tree.
Preguntas de entrevista [1]
Pregunta 1
Identify the data structure and interpret what segment of code does.
Me postulé a través de un reclutador. El proceso tomó 3 semanas. Acudí a una entrevista en National Instruments en oct 2016
Entrevista
Spoke to a recruiter at the college career fair. She called me later that day to set up an interview within the next week. Interviewed on college campus and she said she would get back to me in 3 weeks. Received denial letter within the 3rd week.
Preguntas de entrevista [2]
Pregunta 1
Name a particularly difficult bug you encountered and how did you deal with it?
Me postulé a través de un reclutador. El proceso tomó 3 semanas. Acudí a una entrevista en National Instruments (Austin, TX) en sep 2016
Entrevista
I applied online and through my university's career site. I got an interview around 2 weeks later to be scheduled the end of that week. I got an email after around 2 weeks saying I was rejected. Technical questions were easy, so I'm thinking I didn't correctly answer the behavioral questions.
Preguntas de entrevista [1]
Pregunta 1
Find average of binary tree (Iteratively and Recursively)