SDE - 1

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.

What is the purpose of normalization in DBMS?
Explain the concepts of a Primary key and Foreign Key.
What is the use of DROP command and what are the differences between DROP, TRUNCATE and DELETE commands?

Tell me something about yourself in brief
You have not done your PG yet. This is not a drawback, but don’t you think you should get a PG degree asap?
On a scale of 1 to 10 how would you rate yourself as a leader?
Why do you want to work for us or our company? or Why do you want this job?