Ho presentato la mia candidatura online. La procedura ha richiesto più di una settimana. Ho sostenuto un colloquio presso Intel Corporation (Hillsboro, OR) nel mese di mar 2012
Colloquio
I got a call from HR to setup a technical interview. Three days later I got a call from the engineering manager and it was mostly technical. He was very nice and asked me some basic questions on C and C++, linked-list basics, interrupt handling etc. Next day I got an email for setup of the onsite interview. They flew me out a week later.
Unfortunately the onsite interview was poorly planned as it was not very technical. All technical questions were very basic and largely trivia questions. I probably missed a few but that doesn't mean much any day. I had no opportunity for problem solving or any reasonable length of coding even on a whiteboard. It's their fault for not properly evaluating me or evaluating a candidate based largely on C/C++ trivia questions.
Not surprisingly I don't have an offer so far or even a rejection. I hate being kept in the dark.
Domande di colloquio [1]
Domanda 1
Linked-list loop detection, Interrupt service routine, lots of C pointer stuff.
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Intel Corporation (Toronto, ON) nel mese di ott 2017
Colloquio
Had 3 40-min interviews in one day, interviewed at their Toronto location. The first interviewer gave me a lot of info about the company, their teams, and the work. He also let me ask questions. Asked some questions regarding my position preferences and some questions about my resume. Then jumped into technical questions. The next 2 interviewers jumped right into technical. I had 2 software (data structures and algorithms) interviews and 1 hardware/digital logic interview.
Domande di colloquio [4]
Domanda 1
We have a binary tree. How do we find the longest path (path with the most number of nodes) starting from the head? Part 2: how do we find the longest path that starts from a child and ends at another child and doesn't necessarily pass the head?
We have a graph of nodes (devices) and edges that determine the delay between connected nodes. Find the critical delay path using C or C++, only give the delay number, don't have to return the whole path.
Implement a 2-bit Gray Code counter and draw schematic. How do we determine critical clock frequency, and why don't we consider hold time in this calculation? Given these numbers, find the critical clock freq. How can we clock the circuit at a faster rate if we add delays on this Gray Code counter you implemented.