1st round-(APITUDE ROUND)comprising of c+DS+co+fafl+os+apti(QUANTS)+verbal
60 questions comprising of 90 marks.............
written round-4 questions(c -code,output,link list,tree related question) ........................................
Write a function to swap the adjacent characters of a string.
Ex: "hello world" becomes "ehll oowlrd"
void StringSwap(char *str);
Predict the o/p of a recursive function.
main(){
fib(5);
}
void fib(int m)
{
static int n=0;
if(m==0) return;
n++;
fib(--m);
printf(“%d %d\n”,m,n);
}
Write a function (recursive only) to find the largest element in an array of N numbers.
int FindMax(int *array,int N);
Write a function to insert an element in a singly list so that the elements are in descending order only.
An integer array contains 1 to N unique natural numbers in any order. One of the element in the array is randomly choosen and overwritten by 0(zero) and it is sent as parameter to detectNum( ).
Write a function to detect the number which was replaced by 0(zero). The function declaration is as follows:
void detectNum(int *array,int N);
technical round-(puzzle+question related to logic of written test).....................................
HR round(puzzle+why this company +intro)....................................
