Ik heb online gesolliciteerd. De procedure duurde 1 week. Ik heb gesolliciteerd bij National Instruments in sep 2017
Eenvoudig sollicitatiegesprek
Sollicitatie
Ik heb via een hogeschool of universiteit gesolliciteerd. De procedure duurde 2 weken. Ik heb gesolliciteerd bij National Instruments in sep 2015
Sollicitatiegesprek
I got the interview from my college's career fair. My interview was in a hotel off campus, so that was a little annoying because it took a while to get there. My interview was very set on talking to me about Driver Development, which is not something I'm interested in doing, so that was all a little unfortunate.
Sollicitatievragen [2]
Vraag 1
How would you code a deck of cards for an online game?
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.
Sollicitatievragen [1]
Vraag 1
Identify the data structure and interpret what segment of code does.
Ik heb via een recruiter gesolliciteerd. De procedure duurde 3 weken. Ik heb gesolliciteerd bij National Instruments in okt 2016
Sollicitatiegesprek
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.
Sollicitatievragen [2]
Vraag 1
Name a particularly difficult bug you encountered and how did you deal with it?
Ik heb via een recruiter gesolliciteerd. De procedure duurde 3 weken. Ik heb gesolliciteerd bij National Instruments (Austin, TX) in sep 2016
Sollicitatiegesprek
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.
Sollicitatievragen [1]
Vraag 1
Find average of binary tree (Iteratively and Recursively)