Associate Professional

The output of a specific query.

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.

Bubble Sort is one of the sorting algorithms that works by repeatedly swapping the adjacent elements of the array if they are not in sorted order.

You are given an unsorted array consisting of N non-negative integers. Your task is to sort the array in non-decreasing order using the Bubble Sort algorithm.

For Example:

Bubble Sort implementation for the given array:  {6,2,8,4,10} is shown below :-

1.diff types of polymorphism
2.cloning , types of cloning,  exception by clone method,  type of exception thrown by the clone method. 
3. Association 
4.diff between get and load in hibernate
5.Restful api
6.Maven repository 
7.index in dbms
8.diff between hashmap and hashset
9.value in hashset
10.object class methods 
11. Executor framework
12. Types of collections used in your project
13. Algorithms of garbage collector
14.time complexity of arraylist and linkedlist
15. When to use arraylist and linkedlist

These are situation-based questions where you have to think about your reaction to a situation.

What are your salary expectations?