Asked basic math and algorithm theory . I was given a summation of infinite series . The series formed a GP, basic sets /unions, a set of theorems like the triangular ineuality , max-min flow theorem, four color problem, I was asked what is N and P ( NP complete problems), then complexity of matrix multiplication,Big O notation. if two functions of o(n) complexity were multiplied/added what is the complexity of the resultant function. no eigen vectors and nothing on probability though. Then embedded systems was easy- what is rtos ,its applications, interrupt latency, thread vs process , ISR, virtual memory , semaphore vs mutex, types of semaphores , thread safe, priority inversion C union vs structure, volatile , reentrant code,static , header files, linking, memory section ,bit fields structure and its uses, call by value call by reference , null pointer, typedef vs #define java - access specifiers, abstract class vs interface