BLK Super Speciality Hospital Interview Questions and Answers

The minimum number of socks to be picked to obtain at least 1 rightly colored pair is 3.

• Pick 2 socks of different colors first, then the next sock picked will definitely match one of the colors already picked.

• In the worst case scenario, the first 2 socks picked will be of different colors.

• Therefore, the minimum number of socks to be picked is 3.

To merge two CSV files with 2 columns each in Python, use the pandas library.

• Import the pandas library

• Read the two CSV files into pandas DataFrames

• Merge the DataFrames using a common column as the key

• Save the merged DataFrame to a new CSV file

To reduce vehicle congestion at a junction, implement traffic signal optimization, encourage public transportation, and create dedicated lanes for buses and bicycles.

• Implement traffic signal optimization to improve traffic flow and reduce wait times.

• Encourage the use of public transportation by providing incentives such as discounted fares or improved services.

• Create dedicated lanes for buses and bicycles to reduce the number of vehicles on the road and promote alternative mo...read more

Pass-by-value is a method of passing arguments to a function where the actual value of the argument is copied to a new variable.

• In pass-by-value, a copy of the actual value of the argument is passed to the function.

• Any changes made to the parameter inside the function do not affect the original value outside the function.

• Primitive data types like integers, floats, and characters are typically passed by value.

• Example: int x = 10; foo(x); // the value of x (10) is copied to a n...read more

Use a loop to iterate through the array and keep track of the maximum and second-maximum numbers.

• Initialize two variables to store the maximum and second-maximum numbers.

• Iterate through the array and update the variables accordingly.

• Handle edge cases like when the array has less than two elements.

Insertion Sort is a simple sorting algorithm that builds the final sorted array one item at a time.

• Start from the second element and compare it with the previous elements to find its correct position in the sorted array.

• Repeat this process for all elements in the array.

• Example: Given array of strings ['banana', 'apple', 'orange'], after insertion sort it becomes ['apple', 'banana', 'orange'].