Question Detail: I am looking to calculate the physical address corresponding to a logical address in a paging memory management scheme. I just want to make sure I am getting the calculation right, as I fear I could be wrong somewhere. Read More …
Author: ignougroup
Why, really, is the Halting Problem so important?
Question Detail: I don’t understand why the Halting Problem is so often used to dismiss the possibility of determining whether a program halts. The Wikipedia article correctly explains that a deterministic machine with finite memory will either halt or repeat a Read More …
How to prove a language is regular?
Question Detail: There are many methods to prove that a language is not regular, but what do I need to do to prove that some language is regular? For instance, if I am given that $L$ is regular, how can I Read More …
Distributed vs parallel computing
Question Detail: I often hear people talking about parallel computing and distributed computing, but I’m under the impression that there is no clear boundary between the 2, and people tend to confuse that pretty easily, while I believe it is very Read More …
How to prove that a language is not context-free?
Question Detail: We learned about the class of context-free languages $mathrm{CFL}$. It is characterised by both context-free grammars and pushdown automata so it is easy to show that a given language is context-free. How do I show the opposite, though? My Read More …
To Find the median of an unsorted array
Question Detail: To fine the median of an unsorted array, we can make a min-heap in $O(nlog n)$ time for $n$ elements, and then we can extract one by one $n/2$ elements to get the median. But this approach would take Read More …
Quicksort Partitioning: Hoare vs. Lomuto
Question Detail: There are two quicksort partition methods mentioned in Cormen: Hoare-Partition(A, p, r) x = A[p] i = p – 1 j = r + 1 while true repeat j = j – 1 until A[j] <= x repeat i Read More …
How many edges must a graph with N vertices have in order to guarantee that it is connected?
Question Detail: Possible Duplicate: Every simple undirected graph with more than $(n-1)(n-2)/2$ edges is connected At lesson my teacher said that a graph with $n$ vertices to be certainly connected should have $ {frac{n(n-1)}{2}+1 space }$ edges showing that (the Read More …
What is the difference between user-level threads and kernel-level threads?
Question Detail: After reading several sources I’m still confused about user- and kernel-level threads. In particular: Threads can exist at both the user level and the kernel level What is the difference between the user level and kernel level? Asked By Read More …
What is the average turnaround time?
Question Detail: For the following jobs: The average wait time would be using a FCFS algorithm: (6-6)+(7-2)+(11-5)+(17-5)+(14-1) -> 0+5+6+10+13 -> 34/5 = 7 (6.8) What would the average turnaround time be? Asked By : Sheldon Best Answer from StackOverflow Question Source : http://cs.stackexchange.com/questions/1270 Read More …