Ho presentato la mia candidatura online. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso National Instruments nel mese di set 2017
Offerta accettata
Esperienza positiva
Colloquio facile
Candidatura
Ho sostenuto un colloquio presso National Instruments (Austin, TX) nel mese di gen 2013
Colloquio
I met recruiters at the University career fair, they scheduled an interview the next day, I was initially asked many behavioral questions, like toughest challenge faced, bugs fixed,etc, then I was asked to write a program to sort deck of cards and a program to find average of binary tree with and without recursion. I got an offer after 3 weeks of interview.
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.
Domande di colloquio [1]
Domanda 1
Identify the data structure and interpret what segment of code does.
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso National Instruments nel mese di ott 2016
Colloquio
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.
Domande di colloquio [2]
Domanda 1
Name a particularly difficult bug you encountered and how did you deal with it?
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso National Instruments (Austin, TX) nel mese di set 2016
Colloquio
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.
Domande di colloquio [1]
Domanda 1
Find average of binary tree (Iteratively and Recursively)
