Solicité el puesto a través de un captador. El proceso duró 6 días. Acudí a una entrevista en National Instruments (Gainesville, FL) en feb 2015
Entrevista
Met at career development workshop, was called later that week for an interview. The interview was held in the O'Connell center with many other companies around, two recruiters conducted the interview. I was asked some questions about my resume as well as how I squashed a particularly difficult bug.
Preguntas de entrevista [1]
Pregunta 1
Create a structure for a deck of cards. Given a deck of cards, create a function that shuffles the cards.
Envié una solicitud electrónica. El proceso duró 1 semana. Acudí a una entrevista en National Instruments en sept 2017
Entrevista
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.
Solicité el puesto a través de un captador. El proceso duró 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?
Solicité el puesto a través de un captador. El proceso duró 3 semanas. Acudí a una entrevista en National Instruments (Austin, TX) en sept 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)
