I applied through college or university. The process took 4 weeks. I interviewed at National Instruments (Austin, TX) in Feb 2015
Interview
I spoke to NI at a career expo at my university and got a interview a week later. The interview was fairly relaxed with it having the typical interview questions everyone seems to get which were two behavior questions and finding the average of a binary search tree. I didn't think I did that great, but apparently got an offer 4 weeks later.
Interview questions [1]
Question 1
A time where you showed leadership. About past projects and how I overcame a particularly difficult bug. How to get the average of a binary search tree.
I applied online. The process took 1 week. I interviewed at National Instruments in Sep 2017
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.
Interview questions [1]
Question 1
Identify the data structure and interpret what segment of code does.
I applied through a recruiter. The process took 3 weeks. I interviewed at National Instruments in Oct 2016
Interview
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.
Interview questions [2]
Question 1
Name a particularly difficult bug you encountered and how did you deal with it?
I applied through a recruiter. The process took 3 weeks. I interviewed at National Instruments (Austin, TX) in Sep 2016
Interview
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.
Interview questions [1]
Question 1
Find average of binary tree (Iteratively and Recursively)
