I applied online. The process took 1 day. I interviewed at Aversan (Toronto, ON) in Oct 2015
Interview
Nice and easy going. Everyone was really cool and I felt very welcome. This was a rather straight forward process. Lots of questions about who I am and what I have to offer. This was one of the best interviews ever. The overall experience was welcoming.
I applied online. I interviewed at Aversan (Mississauga, ON) in Aug 2016
Interview
The interview was pretty relaxed and quick. The interviewer told me about the company, then asked what my final year project was and my contribution to it. At the end he gave me a programming question in C. I wrote down my answer and he said one of the software managers will look at it and that was the end of the interview. He showed me around the lab and the facility they have there, as well as one of the controllers they were designing.
Interview questions [1]
Question 1
(In C programming language) Write a program to reverse a null terminated 'C style' string without allocating memory on the heap (basically don't use 'malloc') and without using string library functions.
I applied through university. The process took 5 days. I interviewed at Aversan (Mississauga, ON) in Apr 2016
Interview
Went to online website and submitted resume for role. Got called 2 days later for phone interview. Pass the phone interview and arranged for onsite interview with Manager. Followed up and have not heard back on the process
Interview questions [1]
Question 1
Phone Interview:
Questions about software languages specifically C and C++.
Know your basic theory about OOP.. What is a 'Q' ? What is the stack? What is the Heap?
What is volatile memory? What is non-volatile memory?
Behavior Questions: Why do you want to work for us? What do you do for fun? Do you like fruit?
Onsite interview:
Know you resume inside and out as they will ask all questions derived from resume. At the end will ask you to solve two programming questions in whatever language you are comfortable.
Coding questions:
Give an array of 5 number 5, 4,7, 6, 8, 10 Write a function that sums each index by the next index then sort these numbers and return the sorted array to the user.
Write a function that converts a binary number into a base 10 number given 10110011 covert to base 10?