A. main: create three arrays, each of signed double-words. the first two will hold integer values that will be sent to the gcd function. each element xi in the first array corresponds with each yi in the second array to form a pair. find the gcd, from the procedure, and store the resulting element zi in the third array. use the pairs (20, 5), (9,7), (432, 226), (24, 18), (49, 7), (339, 9), (63, 9). display each pair and the resulting gcd on the screen each time. b. procedure 1: use recursion to implement euclid's algorithm for finding the gcd (greatest common denominator). the function should accept two integers and return an integer. c. procedure 2: accept two arrays of signed double-words and a third parameter that indicates the length of the two arrays. send it the y array (second parameter) and the z array (gcd result) from the main. for each element yi in the first array, if the corresponding zi in the second array is equal, increment a count. return a count of the number of matching array elements in eax. use the invoke statement to call your procedure and pass stack parameters. create a proto declaration for the procedure. save and restore any registers (other than eax) changed by your procedure. the language used: masm (assembly language for x86 processors)

At an open or uncontrolled intersection, yield if a. the cross road has more lanes than yours b. the cross road has fewer land than yours c. you’re on a state highway and the cross road is a secondary road d. do you have three or more passengers in your vehicle

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

Auniversity wants to install a client-server network. which feature do you think is important for them as they set up the network? sending email blocking multiple people to use the same file low security low set up cost limited access to files