Let a system allocate resources to processes as long as the system state remains safe with respect to deadlocks. Note that a system state is safe if there is a way to allocate the remaining resources in such a manner as to satisfy the maximum needs of all the processes. With respect to a resource R, let the system have 10 instances of the resource and let there be five processes P1, P2, P3, P4 and P5 that have maximum needs of 5, 7, 4, 9 and 8 instances of the resource respectively.
Start with a safe state in which P1 is holding no instances, P2, P3 and P4 are holding two instances each and P5 is holding one instance of R. Now, consider each of the following requests. For each request, determine if it can be granted while keeping the system in a safe state. Identify the request that can be granted safely.
A. P1 requesting one instance of R
B. P5 requesting one instance of R
C. P2 requesting two instances of R
D. P4 requesting one instance of R

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.

Explain why it is reasonable to assume that receiving 3 duplicate acks in tcp is an indication that the network is not currently congested.

After you clean an engine with hot water spray, it seems to stall; when it doesn't stall, it's idling noisily. technician a says to check for loose bolts on the flex plate near the torque converter. technician b says to wipe down the spark plug wires and the distributor cap. who is correct? a. technician a b. both technicians a and b c. technician b