Well, first it was AMCAT, as i am a fresher still in college, so this can help freshers too. and it was a pool.
basically there has been 1 round uptil now and w8ing for the result.
this 1st elemination round was conducted in 2 parts 1st was amcat and 2nd was on paper coding questions.
In amcat, there are 4 sections and names were techincal quant computer automata.
first is Quant where u have to attempt 16 question in i guess 20 or 15 min, which was relatively easy.
then second was our basics on inheritance oops and other things 12 questions in 12 min multiple choice easy again.
then it was 2 programing questions, relatively easy.
question 1 Print pattern
1
2*2
3*3*3
3*3*3
2*2
1
queestion 2 rotate matrix
given a matrix of size m*n. you have to rotate the matrix 90 degree clockwise in flag =1 and anticlockwise if flag = 0.
for these 2 questions there was given around 45 min.
then there was some coding related questions have to predict the output and write the output, time was 15 min, and questions were 20. have a lot of recursion and tree and pointers in them, and remember what is the output of Printf statement. is was used multiple time in the question. aming these 20 questions last 10 we have to write the output in a testbox and first 10 were multiple choice.
Now the 2nd part was something like this.
there were total 4 questions.
first 3 questions was coding questions and 4th question was a output one ad that was rather long but easy at the same time just need to maintain focus.
question 1.
you are given a tree. and rather a then doing some thing difficult they just check the child sum property in a awkward manner. a node is comperises of 2 data fields lets data1 and data2.
now data1 is simply the value of the node, while data 2 is the sum of data of its childrens of there data1 positions. and have to check this problem and return 1 is tree satisfy this property and return -1 if not.
question 2
you are given a 1D sorted array, now you have to print the value or index or return that, the position=value or we can say, ( arr[i]=i; ) but make sure its isn't an O(n) time complexity question, we have to give the answer in O(log(n)).
Question 3
You are given a 1D array. and you have to return the ap(airthmetic progression) which have largest length. and do it in O(n) time and O(1) space complexity
now the question is something like this, you are given an array and you have to return the longest sequential Ap differnce, it doesn't matter the difference is how gr8 or small. what all matter is its continous length. just take the difference of a[i] and a[i+1] that will be your current ap difference and increment the ap difference length and if global ap diff length exceeds it just replace it. and in the end return the global ap diff.
Question 4.
i dont have the question with me but the question was takiing your name as input so you have to do that question yourself, no cheating there heheh, not it take your full name as input like this <firstname>*<lastname> replace <firstname> with your name and lastname similarly. now it find your name length and then call a function to reverse it, first i reverse it completely then it reverse it again from pos 3 till end and then it again reverses it from pos 3 till end - pos 3. now it insert it in a binary tree by using the mid point to take the parent method. and time was up thus i wasn;'t able to complete it but it wwas doing this functions again and again with litle tweeks. this is a easy question but ratter a long one. so you can do it just maintain your focus.
thats all for this round, now waiting for the result.
