B L Amlani College of Commerce & Economics Interview Questions and Answers

Given a singly linked list of integers and a reference to a node, delete the specified node from the linked list.

• Traverse the linked list to find the node to be deleted

• Update the pointers to skip over the node to be deleted

• Print the modified linked list after deletion

Count the total number of inversions in an integer array.

• Iterate through the array and for each pair of elements, check if the conditions for inversion are met.

• Use a nested loop to compare each pair of elements efficiently.

• Keep a count of the inversions found and return the total count at the end.

Find the maximum sum of any contiguous subarray within an array of integers.

• Iterate through the array and keep track of the maximum sum of subarrays encountered so far.

• At each index, decide whether to include the current element in the subarray or start a new subarray.

• Use Kadane's algorithm to solve the problem efficiently.

• Example: For array [34, -50, 42, 14, -5, 86], the maximum subarray sum is 137.

Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.

• Divide the input array into two halves recursively until each array has only one element.

• Merge the sorted halves to produce a completely sorted array.

• Time complexity of Merge Sort is O(n log n).

• Example: Input: [3, 1, 4, 1, 5], Output: [1, 1, 3, 4, 5]

Normal forms in database management systems help in organizing data to reduce redundancy and improve data integrity.

• Normal forms are rules used to design relational database tables to minimize redundancy and dependency.

• Boyce-Codd Normal Form (BCNF) is a stricter version of Third Normal Form (3NF) where every determinant is a candidate key.

• BCNF helps in eliminating anomalies like insertion, update, and deletion anomalies.

• For example, consider a table with columns {StudentID, C...read more