J'ai postulé via un recruteur. Le processus a pris 3 semaines. J'ai passé un entretien chez National Instruments (Austin, TX) en févr. 2015
Entretien
I applied at a college career fair. A week or so later, they asked me to apply online, and then they set up an on-campus interview, business casual required. There were two interviewers. For the first half, they asked resume questions, and then they asked technical questions. Only 2 tech questions, and then they said they'd get back to me within 3 weeks.
Questions d'entretien [1]
Question 1
Q1: Find the average value in a binary tree.
Q2: Implement ArrayList using arrays
J'ai postulé en ligne. Le processus a pris 1 semaine. J'ai passé un entretien chez National Instruments en sept. 2017
Entretien
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.
Questions d'entretien [1]
Question 1
Identify the data structure and interpret what segment of code does.
J'ai postulé via un recruteur. Le processus a pris 3 semaines. J'ai passé un entretien chez National Instruments en oct. 2016
Entretien
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.
Questions d'entretien [2]
Question 1
Name a particularly difficult bug you encountered and how did you deal with it?
J'ai postulé via un recruteur. Le processus a pris 3 semaines. J'ai passé un entretien chez National Instruments (Austin, TX) en sept. 2016
Entretien
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.
Questions d'entretien [1]
Question 1
Find average of binary tree (Iteratively and Recursively)