Software Engineer

For a given two-dimensional integer array/list of size (N x M), print it in a spiral form. That is, you need to print in the order followed for every iteration:

a. First row(left to right)
b. Last column(top to bottom)
c. Last row(right to left)
d. First column(bottom to top)

 Mind that every element will be printed only once.

Refer to the Image:

In an operating system, processes are scheduled to execute using many algorithms, of which one is the Round Robin Algorithm. This algorithm ensures democracy in utilizing the CPU time for each of the processes currently in execution.

Assuming that all the processes start executing at the same time, each process gets a fixed time slot (say t seconds) for execution, after which it has to let the next process take the CPU. Let there be 5 processes (p1, p2, p3, p4 and p5) ready for execution. If p1 accesses the CPU at time t0, it should give access to p2 after t0+t seconds and wait. p2 executes from t0+t to t0+2t and so on. Once p5 completes its share of CPU usage, p1 gets its next chance.

Each process can leave this execution loop when its own execution time is over. Therefore, the process with the largest execution time will be the one that would be the last process waiting. Simulate the Round Robin algorithm execution using the set of process burst times and process ids are given.

The processes (runtime) are to be inserted into the queue first and then decremented (by CPU execution time) for each iteration through the queue until their runtime is over.

For Example

Input: 
# Process id's 
proc = [1, 2, 3]
n = 3

# Burst time of all processes 
burst_time = [10, 5, 8] 

# Time quantum 
quantum = 2;

Output:

Processes  Burst time  Waiting time  Turnaround time
1          10          13            23
2          5           10            15
3          8           13            21

Average waiting time = 12
Average turnaround time = 19.6667

You have to place ‘N’ billboards across a highway of ‘M’ kilometres. All the possible sites to place a billboard is given in the ‘billboards’ array. The revenue earned by placing a billboard is described by the ‘revenue’ array, billboard at ‘billboard[i]’ will earn the revenue equal to ‘revenue[i]’. There is a condition that no two billboards can be placed within ‘X’ kilometres of each other.

For Example :

You are given billboards = [2, 8, 9, 10, 15], revenue = [20, 50, 10, 30, 5], ‘M’ = ‘20’, ‘X’ = 5, here we can place the billboard at positions 2, 8, 15, which will give the profit as 20 + 50 + 5 = 75. Hence the answer is 75.

Make a backend server which is capable of realtime communication. The client will connect to this server and gets data (if any change in data occurs) streamed to it in realtime.

Implement a backend server, through which users can remotely perform operations like opening, closing of browser running on server using REST api

Design a system for self hosted data center.

Why should we hire you?

What are your hobbies?