Associate Software Engineer

Given employees table query the nth highest or lowest salary from the employee table where salary is a field in the table

Question were about all OOPS concepts

Pseudo codes that includes loops if else conditions were asked

#include int main(){

    float x = 0.0;    

long int y = 10; 

   printf("%d", sizeof(y) == sizeof(x+y));    

return 0;}

Given a topic should speak on the topic for short duration

You are given an array ‘A’ of size ‘N’ containing only 0s and 1s. You have to sort the array by traversing the array only once.

For Example:

For the following array:
[0 1 1 1 0 0 1]

The output should be [0 0 0 1 1 1 1].

Note:

You have to sort the array in place.

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 are the pillars of OOPS explain with real world examples

Introduce yourself

Tell me about strength and weakness