Problem Detail: I was trying to look my book computer architecture and design, but I can not find the answer for this question. what are-the key-advantages of pipelining? Asked By : Aida Answered By : Illimitable I Googled your question and found this Read More …
Category: Uncategorized
[Solved]: Can a Turing machine have infinite states?
Problem Detail: Does it make sense for a Turing machine to have infinite number of states ? I had previously asked a question Can Turing machines have infinite length input. From which I came to know about Type-2 Turing machines. If Read More …
[Solved]: How should I choose the neighborhood structure for simulated annealing for my problem?
Problem Detail: There are $n$ students and $m$ courses. Each student $i$ wants to attend a subset $C_i subseteq {1,ldots,m}$ of the courses. There are $k$ time slots on a weekly schedule. The goal is to select a time slot for Read More …
[Solved]: How is the implementation of pipes in a OS
Problem Detail: I understand that a pipe is a form of IPC where a process creates a link to communicate with some other process (a child maybe), taking each one a end of the pipe. File descriptors are created for read Read More …
[Solved]: Why can the state space of the 15 puzzle be divided into two separate parts?
Problem Detail: I am trying to understand the proof here of why the state space in 15 puzzle is divided into two separate parts, but the explanation is complicated for me. Could someone please explain it in simpler terms? I have Read More …
[Solved]: The buckets of water problem
Problem Detail: Let’s consider the following problem (buckets/pails of water problem) (This problem may be known with different name. If does, please correct me). Let $B={b_1,…,b_n}$ be a set of $n$ buckets. Suppose each bucket has a maximum capacity $c_i in Read More …
[Solved]: Is there a way to test if two NFAs accept the same language?
Problem Detail: Or at least generate a set of strings that one NFA accepts, so I can feed it into the other NFA. If I do a search through every path of the NFA, will that work? Although that will take Read More …
[Solved]: Is the halting problem specific to Turing machines?
Problem Detail: The proofs that the halting problem is undecidable seem to make very few assumptions about the kind of program/machine under consideration: just that the programs take one input and either loop or produce an output. Not just Turing machines Read More …
[Solved]: How Dynamic programming can be used for Coin Change problem?
Problem Detail: As far as I can unserstand Dynamic programming stands simply for memoization (which is a fancy name for lazy evaluation or plain “caching”). Now, I read that there is we can reduce complexity of coin-change problem by truncating some Read More …
[Solved]: Number of words in the regular language $(00)^*$
Problem Detail: According to Wikipedia, for any regular language $L$ there exist constants $lambda_1,ldots,lambda_k$ and polynomials $p_1(x),ldots,p_k(x)$ such that for every $n$ the number $s_L(n)$ of words of length $n$ in $L$ satisfies the equation $qquad displaystyle s_L(n)=p_1(n)lambda_1^n+dots+p_k(n)lambda_k^n$. The language $L Read More …
