Technical interview asked coding questions like: Give a code snippet, what does this function do and what are some issues? Given a code solution that works but sometimes crashes, point out flaws and issues and how you would fix them or why they're a problem
Firmware Engineer Interview Questions
2,136 firmware engineer interview questions shared by candidates
Talk about this work experience on your resume.
Asked me about my previous academic projects and internship experience. How I used a Kalmann filter that I mentioned in my resume.
What is a fifo structure?
Write code to represent a safe deposit box. The problem with this question is that the U/X, and the interactions with the "real world", are what matter but the interview could not answer much about those aspects. The code itself is nonsense absent a clear and complete analysis of U/X.
How to estimate 16QAM threshold
Given 25 red balls & 25 blue balls. Arrange them in 2 bowls such that when a ball is picked randomly from one of bowls, the probability of picking red ball is maximum??
1. Implement alloc and free function in c, the alloc function always return a pointer to a 1k memory chunk, the free release this memory chunk you can not use malloc, calloc, realloc and free. 2. You need to implement a timer module that has a function timer that gets as input a time and function pointer and call the function when the time is expire, what is the best data structure to use to get the next time in o(1) 2.
you have 50 white balls and red balls. you want to distribute them such that it maximizes your chance of picking a red ball when you select one randomly.
Implement in C some kind of routine that works such that you can, via a function, provide it with a time T and a void* callback, such that in T time from now, the callback will be automatically called. Specifically, optimize the solution to the first 256 units of time since most schedueling will be done for them. To somewhat rephrase things, the system simulates several timers at once using its single internal clock, optimized around a specific time (i.e. the worst case can still be O(log(n)) but the most common/average case of times between 0 and 256 need to be O(1) The second question was more like a riddle,
Viewing 441 - 450 interview questions