Problem Detail: I want to know if longest remaining time first (LRTF) CPU scheduling has starvation or not. Also give reason how it starve/does not starve a process. I know longest job first (LJF) may starve a process if all other Read More …
Category: Uncategorized
[Solved]: Selection, crossover and mutation function choice in genetic algorithms
Problem Detail: I have been developing a GA for one of the projects I’m working on. I have everything implemented with no problems and I really like how GAs work in general, it’s a really cool and relatively new concept. However Read More …
[Solved]: Find shortest paths in a weighed unipathic graph
Problem Detail: A directed graph is said to be unipathic if for any two vertices $u$ and $v$ in the graph $G=(V,E)$, there is at most one simple path from $u$ to $v$. Suppose I am given a unipathic graph $G$ Read More …
[Solved]: What is beta equivalence?
Problem Detail: In the script I am currently reading on the lambda calculus, beta equivalence is defined as this: The $beta$-equivalence $equiv_beta$ is the smallest equivalence that contains $rightarrow_beta$. I have no idea what that means. Can someone explain it in Read More …
[Solved]: Classification of intractable/tractable satisfiability problem variants
Problem Detail: Recently I found in a paper [1] a special symmetric version of SAT called the 2/2/4-SAT. But there are many $text{NP}$-complete variants out there, for example: MONOTONE NAE-3SAT, MONOTONE 1-IN-3-SAT, … Some other variants are tractable: $2$-$text{SAT}$, Planar-NAE-$text{SAT}$, … Read More …
[Solved]: Why is the object destructor paradigm in garbage collected languages pervasively absent?
Problem Detail: Looking for insight into decisions around garbage collected language design. Perhaps a language expert could enlighten me? I come from a C++ background, so this area is baffling to me. It seems nearly all modern garbage collected languages with Read More …
[Solved]: Is single-source single-destination shortest path problem easier than its single-source all-destination counterpart?
Problem Detail: Dijkstra’s algorithm (wiki) and Bellman-Ford (wiki) algorithm are two typical algorithms for the single-source shortest path problem. Both of them compute distances for all nodes from source $s$. If both source $s$ and destination $t$ are fixed, can we Read More …
[Solved]: detect closed shapes formed by points
Problem Detail: I plot several arrays containing xy-coordinates of points (using plot(x,y)) and obtain a plot with some curves. The curves form some very distinctive closed shapes (that is, the points describing the curves lie close to each other). Now I Read More …
[Solved]: Does every problem in NP have an exponential time algorithm?
Problem Detail: I am not sure that every problem in NP have an exponential time algorithm. Since NP does not mean “not polynomial.”, I think the answer is false. But I have no concrete reason about that. Asked By : Jung-Hyun Answered Read More …
[Solved]: How to prove the structured program theorem?
Problem Detail: Wikipedia: The structured program theorem […] states that […] any algorithm can be expressed using only three control structures. They are Executing one subprogram, and then another subprogram (sequence) Executing one of two subprograms according to the value of Read More …
