Software Engineer

There are ‘N’ numbers of processes with process id ‘0’ to ‘N - 1’. You are given two arrays ‘arrival’ and ‘burst’, representing the arrival time and burst time of each of these processes.

If the CPU uses the FCFS process scheduling algorithm, you need to find waiting time, turnaround time, and completion time for each process. Finally, find the average waiting time and average turnaround time for the given processes.

Note:

1. All the processes will have different arrival times.

2. In the FCFS scheduling algorithm, processes that come first ( i.e have lesser arrival time) will be executed first.

3. Turn around time of a Process is the time difference between arrival time and the time at which the process completed.

4. The waiting time of a process is the total time, the process is waiting, i.e. difference between turnaround time and burst time.

5. Completion time is the time at which a process completes.

Example:

Let there be 4 Processes with the following arrival time and burst time.

Wait time, turnaround, and completion time for each process are:

What is deadlock prevention, and how is it implemented in operating systems? (Learn)

Write an SQL query to find the second-highest salary from the Employee table. (Practice)

Transactions in DBMS and ACID properties.

What is the primary purpose of a load balancer in a distributed system?

Which technique is commonly used to improve database scalability by distributing data across multiple machines?

Given an integer array Arr of size N and an integer target, your task is to find the indices of two elements of the array such that their sum is equal to target. Return <-1,-1> if no such pair exists.

Note:

If more than one such pair of indices exist, return the lexicographically smallest pair
You may not use the same element twice.

You are given an unsorted array/list 'ARR' of 'N' integers. Your task is to return the length of the longest consecutive sequence.

The consecutive sequence is in the form ['NUM', 'NUM' + 1, 'NUM' + 2, ..., 'NUM' + L] where 'NUM' is the starting integer of the sequence and 'L' + 1 is the length of the sequence.

Note:

If there are any duplicates in the given array we will count only one of them in the consecutive sequence.

For example-

For the given 'ARR' [9,5,4,9,10,10,6].

Output = 3
The longest consecutive sequence is [4,5,6].

Follow Up:

Can you solve this in O(N) time and O(N) space complexity?

What is the time complexity of searching for an element in a balanced Binary Search Tree (BST)?

What is the time complexity of accessing an element in an array using its index?

What is the average time complexity of insertion and lookup in a HashMap/Hash Table?

You are given an array ‘ARR’ of size ‘N’ containing each number between 1 and ‘N’ - 1 at least once. There is a single integer value that is present in the array twice. Your task is to find the duplicate integer value present in the array.

For example:

Consider ARR = [1, 2, 3, 4, 4], the duplicate integer value present in the array is 4. Hence, the answer is 4 in this case.

Note :

A duplicate number is always present in the given array.

You are given an array 'arr' of length 'n', consisting of integers.

A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning and 0 or more integers from the end of an array.

Find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.

The sum of an empty subarray is 0.

Example :

Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]

Output: 11

Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].

You have a 5-litre jug and a 3-litre jug. Measure exactly 4 litres of water.

Three switches outside control three bulbs inside a room. You can enter the room only once. Identify which switch controls which bulb.