You have 3 input streaming channels, 3mbps each. You need to deliver all of this (9mbps streaming data) via single output channel with 3mbps max bandwidth. You don't know the nature of the data, compression doesn't work, nobody you can ask about other requirements - you are the owner of the solution. The interviewer didn't provide any more clarification.
It was related to .NET & Entity framework
One of the interviewers was very curious about my life outside of working in software. He spent some time probing my hobbies and what gets me excited. It was the first time a professional interviewer took some time to learn who I was as a person.
The most difficult AND unexpected question was what is my current pay rate (I am a contractor at another major medical device company). I di not want to give his the exact number but asked what is the salary range for the job position. His response was from $100 to $130K. I replied that my rate lies exactly in the middle of this range. However he insisted that I need to give his the exact number. I tried to give him a range what I would be interested in. Again he insisted I give him the rate otherwise I will have a problem getting the next interview.
Sr.Director focused so much on White papers and Patents giving the impression that it felt like most of the CA employees have White papers/Patents which is not true. He asked why I didn't have White papers/Patents till now and grilled as if that is the minimum requirement for this position...which is not true again.
what is SQL DBA Funtions
Mostly open ended questions - tell me about xyz technical questions. Tell me about REST. Tell me about Agile/Scrum. We are looking for someone who knows C++. The job listing showed it as "nice to have".
Given an arbitrary list of components and their dependencies, both direct and transitive, describe an algorithm to compute a flat, ordered list of components such that when installing any one component, all dependent components will have been installed.
1. Database scaling strategies 2. Given a sorted array and a number x, find a pair in array whose sum closest to x.
Autocorrect words api
Viewing 21 - 30 interview questions