Algorithms Test...

Which of following problems cannot be solved using greedy approach?

What is the efficient asymptotic running time to find the median of a two-sorted array after merging it?

Recurrence relation for the time complexity of matrix multiplication using simple divide and conquer is:

We are given 9 – tasks T1, T2, T3, T4,...... T9 . The execution of each task requires one unit of time. Each task Ti has a profit P_i and a deadline D_i. You will get profit P_i if the task T_i is completed before the end of the deadline D_i.

If maximum profit is earned then

Consider an array nums in which there is only one duplicate number findDuplicate() returns that duplicate number. Arrays.sort(nums) sort the array nums and nums.length gives the length of array.

Consider the below given block of code which is used   find the duplicate one.

int findDuplicate(int nums[ ]) {
        int length = nums.length-1;
        if(length == 0)
            return 0;
        Arrays.sort(nums);
        for(int i=0; i<length; i++)
        {
            if(nums[i] == nums[i+1])
                return nums[i];
        }
        return 0;   
}

Which algorithm design technique is followed in the above case to get the specified result?

Let a one-dimensional array declare and initialize as int Array =  {1, 5,-6, 11, -2, -3, 6, -1, -2, 1, 4, 5, -3, 4, -2}

The subsequence sum \(X\left( {m,n} \right) = \mathop \sum \nolimits_{x = m}^n Array\left[ x \right]\). Determine the maximum of X(m, n) where 0 ≤ m ≤ n < 15?

NOTE: Use divide and Conquer Technique

In a merge sort algorithm, the worst case takes 2048 seconds for an input size of 65536. What is the maximum input size of a problem that can be solved in 16 minutes (chose the close approximate answer)?

Consider the table given below consisting of 5 items with their profit and weight associated with it.

The weight of the knapsack is 90. Find the maximum profit gain by applying fractional knapsack?