There were four section:

1. Aptitude: They had fairly simple arithmetic question, questions on geometry and questions like whether information can be deduced from the comments given. It was fairly easy and just u need to have basic clear.

2. Analytical: Questions like pattern matching, odd one out were there. Be careful while attempting these two sections that u wont be having much time. Before u know the time is over.

3. Computers: This paper is mostly from the topics u cover in B.Tech. there was one question on finite automata, Bit manipulation (flipping the bits), drawing the tree given preorder and inorder traversal, finding the formula for N-ary tree to fine number of external nodes.

4. C/Java: Here u had to write C programs (Mind u no mutiple questions). There was one question to write program to search a string from bigger string, write a algorithm to compute X^n which is of complexity log n, implement atoi function. (U cannot use any standard function in these.)

1. Aptitude: They had fairly simple arithmetic question, questions on geometry and questions like whether information can be deduced from the comments given. It was fairly easy and just u need to have basic clear.

2. Analytical: Questions like pattern matching, odd one out were there. Be careful while attempting these two sections that u wont be having much time. Before u know the time is over.

3. Computers: This paper is mostly from the topics u cover in B.Tech. there was one question on finite automata, Bit manipulation (flipping the bits), drawing the tree given preorder and inorder traversal, finding the formula for N-ary tree to fine number of external nodes.

4. C/Java: Here u had to write C programs (Mind u no mutiple questions). There was one question to write program to search a string from bigger string, write a algorithm to compute X^n which is of complexity log n, implement atoi function. (U cannot use any standard function in these.)

## No comments:

## Post a Comment