Senior Software Engineer

Question- For an effective operating system, when to check for deadlock?
a) every time a resource request is made at fixed time intervals
b) at fixed time intervals
c) every time a resource request is made
d) none of the mentioned

2- For what purpose the DML is provided?

a- Addition of new structure in the database
b- Manipulation & processing of the database
c- Definition of the physical structure of the database system
d- All of the above

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

You come across 100 closed doors in a straight line. You make 100 passes through each gate, starting with the first one. The first time you walk by a door, you open the closed ones and close the open doors. The second time you walk past the door, visit any door the first time you walk, and if it is closed, you open it, and if it is open, you shut it. You visit every other door on your second pass by, starting from the second, skip-counting them by two. In the 3rd pass, you go to every third door, in the fourth round to every 4th and so on. When reaching the 100th door, during your last round, which doors are open, and which are closed?

- Introduce Yourself? 

- Describe about your career? 

- What technologies you are intrested in? 

- Are you like travelling all over the world?