Associate Software Engineer

All roses are flowers. Some flowers fade quickly. Which of the following conclusions definitely follows?

If in a certain language, MANGO is coded as OCPIQ, how is APPLE coded?

What comes next in the series? 2, 6, 12, 20, 30, ? A) 36 B) 40 C) 42

If × means addition, ÷ means subtraction, + means multiplication, and - means division, then what is the value of: 12 + 6 × 2 - 4 ÷ 2

In Round Robin scheduling, if the time quantum is very large, it will behave like? (Learn)

In a multitasking operating system, which of the following scheduling algorithms is most suitable for a time-sharing system? (Learn)

What will be the output of the following code snippet? 
#include void solve() {     
int x = 2;     
printf("%d", (x << 1) + (x >> 1)); }
int main() 
{     
solve();  
return 0;
}

There is a one-dimensional garden of length 'N'. On each of the positions from 0 to 'N', there is a fountain, and this fountain’s water can reach up to a certain range as explained further. In other words, there are 'N' + 1 fountains located at positions 0, 1, 2, 3, …. 'N' which can be activated in the garden.

You are given an integer 'N' and an array/list 'ARR' of length 'N' + 1, where each index of the array denotes the coverage limit of a particular fountain.

A fountain at index 'i' can water the area ranging from the position 'i' - 'ARR'['i'] to 'i' + 'ARR'['i'].

Your task is to find the minimum number of fountains that have to be activated such that the whole garden from position 0 to 'N' has access to the water from at least some fountain.

Note:

1. 0-based indexing is used in the array.
2. We only care about the garden from 0 to 'N' only. So if i - 'ARR'['i'] < 0 or i + 'ARR'['i'] > 'N', you may ignore the exceeding area.
3. If some fountain covers the garden from position 'A' to position 'B', it means that the water from this fountain will spread to the whole line segment with endpoints 'A' and 'B'.

Given an array 'arr' with 'n' elements, the task is to rotate the array to the left by 'k' steps, where 'k' is non-negative.

Example:

'arr '= [1,2,3,4,5]
'k' = 1  rotated array = [2,3,4,5,1]
'k' = 2  rotated array = [3,4,5,1,2]
'k' = 3  rotated array = [4,5,1,2,3] and so on.

You are given an array ‘ARR’ of length ‘N’ consisting of only ‘0’s and ‘1’s. Your task is to determine the maximum length of the consecutive number of 1’s.

For Example:

ARR = [0, 1, 1, 0, 0, 1, 1, 1], here you can see the maximum length of consecutive 1’s is 3. Hence the answer is 3.

Describe and show the code for your final year project, and explain the code flow.

Implement inheritance and encapsulation, along with one real-life example.

Write a SQL query to fetch specific columns using aliases and filter conditions.

Also, describe the ACID properties.

You have 3 vessels and 8 parts of liquid. How would you distribute the liquid among the vessels?

Are you open to relocation?

Which tech stack are you comfortable with?

Any doubts or clarifications needed?