Using the principles and strategies of saving and investing, create a saving and investing plan. Remember, a sa investing plan is an outline or list that names the types of savings or investments you will use. The outline also st the amount or percentage you will put into each savings account or investment. For this project, evaluate and select at least three investments or savings accounts. Submit you plan and answer following questions: 1. Did your overall portfolio increase or decrease in value? Which investments or accounts increased and which decreased? By how much? 2. What did you learn about investing from this project? 3. Did you learn about how much risk you like to take? 4. Did you learn about how much work is involved in selecting investments? Explain.

What do the principles of notice, choice, onward transfer, and access closely apply to? a. privacyb. identificationc. retentiond. classification

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

You can apply several different worksheet themes from which tab?