1. what are the main functions of the cpu? 2. how is the alu related to the cpu? what are its main functions? 3. how many bits are required to address a 4m * 16 main memory if a) main memory is byte addressable? b) main memory is word addressable? 4. how many bits are required to address a 1m * 8 main memory if a) main memory is byte addressable? b) main memory is word addressable? 5. how many 256 * 8 ram chips are needed to provide a memory capacity of 4096 bytes? a) how many bits will each address contain? b) how many lines must go to each chip? c) how many lines must be decoded for the chip select inputs? specify the size of the decoder. 6. suppose that a 16m * 16 main memory is built using 512k * 8 ram chips and memory is word addressable. a) how many ram chips are necessary? b) how many ram chips are there per memory word? c) how many address bits are needed for each ram chip? d) how many banks will this memory have? e) how many address bits are needed for all of memory? f) if high-order interleaving is used, where would address 14 (which is e in hex) be located? g) repeat this problem for low-order interleaving.

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

What provides an array of buttons for quick access to commonly used commands and tools

What does a bonus object do? a. subtracts lives b. keeps track of a player's health c. gives a player an advantage d. makes text appear