In the aptitude round, you will be asked questions about fundamental numerical skills, data interpretation, logical reasoning, and programming languages in the aptitude test.
This round will be for 45 minutes. One can prepare questions for hashing (linear probing), Counting Page Faults, BST preorder and postorder, Graph minimum distance (for example shortest path from 1 to n, Your task is to complete the minimumStep() function.
which takes N as an input and returns the result, another example is Smallest window containing 0, 1 and 2), Recursion(Given a recursive function f(int a), find f(8)),
Find Inorder successor in BST, then you may come across questions on String Manipulation, Matrix Problem, Data Structures, OS, DBMS, some coding questions, etc.
Part 1 of the test contained multiple-choice questions about probability, puzzles, data structures, and other topics. The questions were quite difficult. For the math problems, it is recommended that you practice CAT level questions; I found the test difficult because I hadn’t prepared CAT level questions. Questions about data structure included what the left child of a node would be given the in-order and pre-order sequence.