first technical interview
1. project description
2.program to find a/b without using
division or mod operator
3. program using recursion
4 questions on those which u have
done wrong in the written test
5 and a few puzzles
second technical interview
1.program to find whether the system
is big endian or little endian
2.program to implement structures
and array of structures
3.syntax for function pointer and
array of function pointers
4.reversing a linked list
5. questions on trees
6. a few puzzles like finding a
faulty coins with minimum measurings
third technical round
1.from DSP like what is aliasing..?
2. find the properties of a system
with the given transfer function
3.arithmetic and geometric
progression
4. asked to find an expression to
find the number of leafs in a binary tree with m number of nodes with 2
children and n number of nodes with one child
