Suppose you were to drive from madison to rapid city (black hills), south dakota along i-90. your gas tank when full holds enough gas to travel m miles and you have a map that gives distances between gas stations along the route let d1 < d2 < < dn be the locations of all the gas stations along the route where di is the distance from madison to the gas station i. you can assume that the distance between neighboring gas stations is at most m miles. your goal is to make as few gas stops as possible along the way. give a greedy algorithm you can find to determine at which gas stations you should stop and prove that your strategy yields an optimal solution.

What can you find the under the privacy policy section of a shopping website?

Some of your friends have gotten into the burgeoning field of time-series data mining, in which one looks for patterns in sequences of events that occur over time. purchases at stock exchanges--what’s being bought-- are one source of data with a natural ordering in time. given a long sequence s of such events, your friends want an efficient way to detect certain "patterns" in them--for example, they may want to know if the four events buy yahoo, buy ebay, buy yahoo, buy oracle occur in this sequence s, in order but not necessarily consecutively. they begin with a collection of possible events (e. g., the possible’ transactions) and a sequence s of n of these events. a given event may occur multiple times in s (e. g., yahoo stock may be bought many times in a single sequence s). we will say that a sequence s’ is a subsequence of s if there is a way to delete certain of the events from s so that the remaining events, in order, are equal to the sequence s’. so, for example, the sequence of four events above is a subsequence of the sequence buy amazon, buy yahoo, buy ebay, buy yahoo, buy yahoo, buy oracle their goal is to be able to dream up short sequences and quickly detect whether they are subsequences of s. so this is the problem they pose to you: give an algorithm that takes two sequences of even~s--s’ of length m and s of length n, each possibly containing an event more than once--and decides in time o(m n) whether s’ is a subsequence of s

List 3 items that were on kens resume that should have been excluded