I applied through university. The process took 2 days. I interviewed at National Instruments (Pittsburgh, PA) in Feb 2015
Interview
NI came to my university's career fair. After I talked to them and submitted my resume, they called me that night to set up an interview for the next day. The 30 minute interview was with 2 recruiters. It started off with some questions about my interests and past projects. After the behavioral part, they asked one pretty simple technical question. After I answered it, they asked me one follow up question about it. The last 5 or so minutes were for additional questions. They took me out to dinner that night and I got my offer after a week.
I applied online. The process took 1 week. I interviewed at National Instruments in Sept 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 Sept 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)