Technology Consultant - Associate

There were two Panelist to judge you, At first, they told all 5 of us to give our Intro, then they told us our Topic – Cashless Economy, and again asked each one of us to speak few words on the topic, after that, we were asked to choose a side whether for the topic or against the topic, and then GD started, and Luckily all 5 of us were selected for the Next Round due to Healthy and Disciplined discussion (this was the compliment given by them at the end).

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 :-

Six question on SQL were asked: -

1. What are Joins?
2. For the below questions, tables were provided
3. Select name of Employees whose Salary is greater than 5000?
4. Select name of Employees who works for Finance Dept?
5. Find Number of people who live in Delhi?
6. Display Age of people who live in Delhi and work for Finance Dept?

There are 10 stacks of 10 identical-looking coins. All of the coins in one of these stacks are counterfeit, and all the coins in the other stacks are genuine. Every genuine coin weighs 10 grams, and every fake weighs 11 grams. You have an analytical scale that can determine the exact weight of any number of coins. What is the minimum number of weighings needed to identify the stack with the fake coins?

Selection sort is one of the sorting algorithms that works by repeatedly finding the minimum element from the unsorted part of the array and putting it at the beginning of the unsorted region of the array.

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 Selection Sort algorithm.

For Example:

Selection Sort implementation for the given array:  {29,72,98,13,87,66,52,51,36} is shown below :-

If at a certain night I am given 2000 PDFs which contains Information of a person each, like a person’s name, salary, hobbies, etc and I have to submit the abstract to my boss for each and every PDF Next Morning, What would I do?

If you are provided with two tables and I ask you to print non-common elements from both tables, What will you do?