Everyone learns how to do recursion with the Fibonacci sequence in Programming 101. Do it programmatically without recursion.
Implement and test a memcpy function Given a function header (in fact an out-of context function call):
memcpy(src, dst, size)
Write an implementation and test cases.
Be sure to ask additional questions on what exactly the function does and the range of arguments as well.
Implement an allocator Implement a memory allocator, i.e. malloc function, free function and all data structures, needed for that.
A line of 100 airline passengers is waiting to board a plane. they each hold a ticket to one of the 100 seats on that flight.
Question: Tell me about yourself. Many
candidates, unprepared for the question, skewer themselves by rambling,
recapping their life story, delving into ancient work history or
personal matters.
What are your greatest weaknesses Beware
- this is an eliminator question, designed to shorten the candidate
list. Any admission of a weakness or fault will earn you an “A” for
honesty, but an “F” for the interview.
