The written test involved questions on database, UNIX, manual testing, Reasoning and Data Interpretation.
Sigiloso
It can be done using recursion. Following is the function which gives the gcd of two no. int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }