Problem Detail: What do I need to read in in order to : understand the specs of an already made programming language Design a programming language Design a compiler and assembler for that language make an architecture of a processor Asked Read More …
Author: ignougroup
[Solved]: Null Hypothesis in Analysis and Testing
Problem Detail: I have my end of year exams next Thursday. I’m generally doing fine but I am having some major issues with this strand of my course, this has to be the biggest issue I have. So, here is the Read More …
[Solved]: Hardness proof of EVEN-ODD PARTITION
Problem Detail: The PARTITION problem is NP-complete: INSTANCE: finite set $A$ and a size $s(a) in mathbb{Z}^+$ for each $a in A$ QUESTION: Is there a subset $A’ subseteq A$ such that $sum_{a in A’} s(a) = sum_{a in A setminus Read More …
[Solved]: Efficient algorithm for iterated find/replace
Problem Detail: I’m looking for an algorithm for doing iterated find/replace, where the act of finding the replacement list of tokens for a given find is slow. Specifically: I have a function, f, that maps a sequence of tokens to either Read More …
[Solved]: Best Fit Memory Allocation Algorithm Statistical Analysis
Problem Detail: I’ve been reading book on Operating System, in which author writes : Somewhat surprisingly, it(Best fit) also results in more wasted memory than first fit or next fit because it tends to fill up memory with tiny, useless holes. Read More …
[Solved]: Complexity inversely propotional to $n$
Problem Detail: Is it possible an algorithm complexity decreases by input size? Simply $O(1/n)$ possible? Asked By : mmdemirbas Answered By : Peter Consider an algorithm with some running time bounded by $f(n)$ and suppose that $f(n) in O(1/n)$. That means that there Read More …
[Solved]: Unprovable Post correspondence problem instance
Problem Detail: Since there is no algorithm for the post correspondence problem, there exists an instance of this problem such that we can neither prove that the instance is positive nor prove that the instance is negative, i.e. an unprovable instance Read More …
[Solved]: Designing a prefix code for integers?
Problem Detail: trying to figure out how to approach this problem. Suppose a sender in a network wanted to communicate the length n of the block it will be using in a subsequent transmission. If there were not limits on the Read More …
[Solved]: Is the question of whether the language of a DFA/CFG is equal to a particular set of string decidable?
Problem Detail: Suppose I have a set of strings $S$ that is generated from the alphabet. Suppose I have a DFA $D$ and a CFG $G$, are the questions of ${Dmid Dtext{ is a DFA and }L(D) = S}$ and ${Gmid Read More …
[Solved]: Why the Smallest Operable Data Type in Most Programming Languages Is One-Byte Sized?
Problem Detail: Why the smallest operable data type in most programming languages is one-byte sized? Is it possible that to operate with a single bit? If it is possible, how to do it in practical? Asked By : WeZZard Answered By : adrianN Read More …
