Problem Detail: Here is a resource allocation graph asked in my Operating Systems Theory midterm. The question is, “Is there a deadlock here? Explain your answer in detail” Ra and Rb are resource sets and every dot inside of them Read More …
IgnouGroup Social Campus
Problem Detail: Here is a resource allocation graph asked in my Operating Systems Theory midterm. The question is, “Is there a deadlock here? Explain your answer in detail” Ra and Rb are resource sets and every dot inside of them Read More …
Problem Detail: So basically L satisfies the conditions of the pumping lemma for CFL’s but is not a CFL (that is possible according to the definition of the lemma). Asked By : user2329564 Answered By : Yuval Filmus The classical example is $L Read More …
Problem Detail: In a queuing system (M/M/1) with a finite packet capacity $z$, how do you determine the probability of packet loss if we assume that packets are dropped when the system is full? Packets arrive with a rate $lambda$ and Read More …
Problem Detail: Let $A$ and $B$ be Turing-recognizable languages. Must language $C = A cap B$ be Turing-recognizable too? I have a hunch that it should be because we can construct an enumerator for $C$ by enumerating all the languages in Read More …
Problem Detail: I was reading Operating Systems by Galvin and came across the below line, Not all unsafe states are deadlock, however. An unsafe state may lead to deadlock Can someone please explain how deadlock != unsafe state ? I also Read More …
Problem Detail: This figure says according to moore’s law number of transistors doubles about two years. but clock speed, power flattening after given stage. can anyone describe the reasons this flattening in clock-speed. Why can’t we increase the clock speed Read More …
Problem Detail: I have thought about the most useful way of checking an array for 2 elements that sum to X. The trivial solution is to check the sum of every element with every element, and the complexity of this solution Read More …
Problem Detail: I’m familiar with a few problems of each class and even though the definitions are based on sets and polynomial reducibility, I see a pattern with time complexity. NP problems appear to be $O(2^n)$ (minus the P problems of Read More …
Problem Detail: Wikipedia as well as other sources that I have found list C’s void type as a unit type as opposed to an empty type. I find this confusing as it seems to me that void better fits the definition Read More …
Problem Detail: Assume that I have a file that consists of pairs of numbers separated by a space. These numbers are the labels for vertices in my graph. For example: 0 5 0 7 2 3 4 5 1 5 . Read More …