Reference no: EM131407860
Q1. You are given a one dimensional array that may contain both positive and negative integers. Give an O(n log n) algorithm to find the sum of contiguous (ie. next to one another, in sequence) sub-array of numbers which has the largest sum. For example, if the given array is [-2, -5, 6, -2, -3, 1, 5, -6], then the maximum sub array sum is 7 (the sub array is marked in boldface). Argue that your algorithm is correct.
You get as input n distinct positive integers a1, . . . , an. Give an O(n log n) algorithm to count the number of pairs i < j where ai > 2aj.
Q2. You are given two arrays, A and B, each of which contains n integers. The elements in each array are guaranteed to already be in sorted order in the input, i.e.
A[0] ≤ A[1] ≤ . . . ≤ A[n - 1],
and also
B[0] ≤ B[1] ≤ . . . ≤ B[n - 1].
Give as fast an algorithm as you can for finding the median value of all the 2n numbers in both A and B. (We define the median of 2n numbers to be the average of the nth smallest and nth largest values.) Argue that your algorithm is correct and give its running time.
Q3. You are given an array X of n elements. A majority element of X is any element occurring in more than n/2 positions. The only access you have to the array is to compare any two of its elements for equality; hence you cannot sort the array, etc. Design an O(n log n) divide-and-conquer algorithm to find a majority element in X (or determine that no majority element exists).
Q4. You are given a 2k x 2k board with one missing cell. Give an O(22k)-time algorithm for filling the board with "L-shaped" tiles. (See Figure 1 below.)
5. Consider you get as input a very sparse undirected weighted graph G = (V, E), in particular for which [E] - [V] = 20. Give an O(|V|) time algorithm for finding a minimum spanning tree on G and prove your algorithm correct.
Note - Question 1 has 2 different separate questions (Part A and B) with 2 different solutions.
The ethical frontiers of robotics
: Write an essay in response to Noel Sharkey's "The Ethical Frontiers of Robotics." This assignment asks you to relate your own ideas to those in Sharkey's article.
|
What was last year’s dividend per share
: One week after Granddad's Kitchen split its stock 3-for-1, it paid a dividend of $0.55 per new share. The dividend payment was 10 percent greater than last year's presplit dividend. What was last year's dividend per share?
|
What is the inventory turnover
: Big Bang Fireworks normally purchases $120,000 of inventory each day. Each item normally remains in inventory 18 days before it is sold.
|
What is the company''s accounts receivable turnover
: A + Airplanes normally sells $125,000 of its product on credit each day, and it takes an average of 40 days to collect the credit sales.
|
Algorithm to find the sum of contiguous
: You are given a one dimensional array that may contain both positive and negative integers. Give an O(n log n) algorithm to find the sum of contiguous (ie. next to one another, in sequence) sub-array of numbers which has the largest sum
|
What is the average balance in accounts receivable
: If CLS can reduce its DSO to 45 days, what impact would this change have on its accounts receivable balance?
|
Find the median number of goals
: The table below shows information about the number of goals scored by a football club in eahc of its last 45 games. find the median number of goals. Show your working clearly.
|
Professional or academic journal
: The selected article must be from a professional or academic journal, at least two pages in length, and published within the last five years. Be sure that the article is specific to occupational safety and health as some search terms may result in..
|
Identify the potential market segments
: Using the following list of products, identify the potential market segments of each product based on demographics, psychographic, and behavioral differences. Prepare a brief report and explain the segmentation variables associated with each examp..
|