Candidatei-me online. O processo levou 1 semana. Fui entrevistado pela National Instruments em set. de 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.
Perguntas de entrevista [1]
Pergunta 1
Identify the data structure and interpret what segment of code does.
Candidatei-me por meio de uma faculdade ou universidade. Fiz uma entrevista na empresa National Instruments.
Entrevista
It was a on-campus interview and the questions revolved about data structures like binary tree and linked list. Some of the questions are:
1) How will search in a binary tree. I was told to write a code for this.
2) How will you design an algorithm to implement the shuffle concept in ipod? - Tell about the seed and random concept to explain the second question.
Perguntas de entrevista [1]
Pergunta 1
How will you design an algorithm to implement the shuffle concept in ipod?
Candidatei-me por meio de recrutador(a). O processo levou 3 semanas. Fui entrevistado pela National Instruments em out. de 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.
Perguntas de entrevista [2]
Pergunta 1
Name a particularly difficult bug you encountered and how did you deal with it?
Candidatei-me por meio de recrutador(a). O processo levou 3 semanas. Fui entrevistado pela National Instruments (Austin, TX) em set. de 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.
Perguntas de entrevista [1]
Pergunta 1
Find average of binary tree (Iteratively and Recursively)
