For problem "3", choose either 3a (25 points) or 3b (35 points). problem 3a: (20 points) based on problem 7-30 array of function pointer exercises 7.30 (caleulating circle circumference, circle area or sphere volume using function pointers) using the techniques you learned in fig. 7.28, create a text-based, menu-driven program that allows the user to choose whether to calculate the circumference of a circle, the area of a circle or the vol- ume of a sphere. the program should then input a radius from the user, perform the appropriate calculation and display the result. use an array of function pointers in which each pointer represents a function that returns void and receives a double parameter. the corresponding functions should each display messages indicating which calculation was performed, the value of the radius and the result of the calculation. problem 3b: (35 points) repeat problem 3a and add another pointer/command to give all parameters in addition to asking for diameter or radius, as discussed in class. that is enter "d 10" this means you have entered a diameter. or "r 5" means you have entered a radius. then proceed to to calculations as follows: 0 yield to circumference calculations 1 yield to area calculations 2 yield to volume calculations 3 yield to all calculations and 4 exit the program commands

Look at the circuit illustrated in the figure above. assume that the values of r1 and r2 are equal. if you connect your meter’s test probes to points a and b in the circuit, which of the following voltages would you measure

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 events"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.

Three out of five seniors remain undecided about a college major at the end of their senior year.