Category: Uncategorized

Problem Detail: I have the following problem, I would like to know an efficient algorithm to solve it. Suppose I have a weighted graph $G$ and a set of vertices $K$, I want to find a walk which starts at a Read More …

Problem Detail: Assume the halting problem was decidable. Is then every recursively enumerable languagerecursive? Asked By : umang Answered By : Peter While we know for sure that the halting problem is (and always will be) undecidable by a Turing machine, we can Read More …

Problem Detail: Reducing one computable problem to another by providing an algorithm which transforms an instance of one problem to one of the other (and limiting the time or space of that algorithm) is clear to me. However, I fail to Read More …

Problem Detail: There are many solutions on the web showing that the subset-sum problem is polynomial time reducible to the set-partition problem. However, during my search, I came across the following powerpoint presentation (slide 12), where it says that the inverse Read More …

Problem Detail: I am trying to understand dynamic programming and I am watching this mit video. If you guys could take some time out , can you refer to the slide on 41:36 . Why is the height m+n. I just Read More …

Problem Detail: Two processors $A, B$ with inputs $a in {0, 1}^n$ (for $A$) and $b in {0, 1}^n$ (for $B$) want to decide whether $a = b$. $A$ does not know $B$’s input and vice versa. A can send a Read More …

Problem Detail: I’m having difficulty understanding what my book is trying to say in regards to preemptive and non-preemptive CPU scheduling. It says the following: CPU Scheduling decisions may take place under the following four circumstances: When a process switches from Read More …

Problem Detail: I want to flatten a binary tree into a linear array, and I wonder if there are specific algorithms to improve locality in the linearized representation (for instance, ensuring that all data from the left child of the root Read More …

Problem Detail: In this question, we abuse the mathematical notation to express bitwise operations in the following way: $ll$ is a binary left shift $oplus$ is a bitwise XOR $0b1, 0b110, 0b10 ldots$ are used to denote raw bits $repr$ is Read More …

Problem Detail: Could you explain me, how can I check, that the language of first context-free grammar (G1) is a subset of the language of second context-free grammar (G2). G1 and G2 are two LL(1) grammars with identical alphabets: {a, b, Read More …