System Engineer

It's a MCQ based round consisting of 66 questions with medium difficulty . Topics Covered :


From Quantitive 


1) Profit /Loss ( I guess their fav )
2) Simple/Compound Interest
3) Mixtures , Allegations and Percentage
4) Time and Work
5) Distance 
6) Permutation , combination and probability

From Qualitative analytics - The questions asked from qualitative analysis are quite easy .If you have good practise on Seating Arrangements, Coding and Decoding, Number Series, Data Sufficiency, Syllogism, Clocks and Calendar, Data Interpretation etc on the topics you can answer maximum of the questions.

Verbal Ability - They can ask from any topics which are not hard but one should have a good practise on verbal questions before appearing for this round.

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.

Note :

It is compulsory to use the ‘Merge Sort’ algorithm.

You are given an array of integers. You need to sort the array in ascending order using quick sort.

Quick sort is a divide and conquer algorithm in which we choose a pivot point and partition the array into two parts i.e, left and right. The left part contains the numbers smaller than the pivot element and the right part contains the numbers larger than the pivot element. Then we recursively sort the left and right parts of the array.

Example:

Let the array = [ 4, 2, 1, 5, 3 ]
Let pivot to be the rightmost number.

After the 1st level partitioning the array will be { 2, 1, 3, 4, 5 } as 3 was the pivot. After 2nd level partitioning the array will be { 1, 2, 3, 4, 5 } as 1 was the pivot for the left part and 5 was the pivot for the right part. Now our array is sorted and there is no need to divide it again.