Category: Uncategorized

Problem Detail: Inspired by this question in which the asker wants to know if the running time changes when the comparator used in a standard search algorithm is replaced by a fair coin-flip, and also Microsoft’s prominent failure to write a Read More …

Problem Detail: I am confused why Binomial heaps do not utilize marking. Concerning Fibonacci heap children: Each tree in a Fibonacci heap is allowed to lose at most two children before that tree needs to be “reprocessed” at a later step. Read More …

Problem Detail: I’m reading multi-level cache and came across a question through which i got confused. I’ve read that Between processor and Cache Word/ Byte is transfered Between Cache and Main memory Block(Block of words) is transfered. If there is a Read More …

Problem Detail: I am a beginner in the topic of algorithms. I have a query about Greedy Algorithms. From what I understand, if there is a function and we are supposed to find its maxima/minima, if we find the local maxima/minima, Read More …

Problem Detail: In a Whitted ray tracer, each ray-object intersection spawns a transmitted ray (if the object was translucent), a reflected ray and a shadow ray. The shadow ray contributes the direct lighting component. But what happens if the shadow ray Read More …

Problem Detail: Why is the reduction $textbf{SAT} leq_P textbf{3SAT}$ possible, but $textbf{SAT} leq_P textbf{2SAT}$ not possible, given, that $textbf{SAT}$ is $textbf{NP}$-complete, $textbf{2SAT} in textbf{NP}$ and $textbf{3SAT} in textbf{NP}$? Asked By : Anderson Answered By : mdxn I believe the asker is wanting to Read More …

Problem Detail: I’m considering an automaton $A$ over a alphabet $Sigma$, with a set of states $Q$, such that $Sigma subset Q$, which includes special “accept” and “blank” states not in $Sigma$. It also has an infinite list of cells, which Read More …

Problem Detail: I’m trying to find a polynomial time algorithm for finding the minimum vertex cover for a graph. I’ve written the algorithm below; I know this problem is $mathsf{NP}$-hard, which means there are probably some graphs for which this algorithm Read More …

Problem Detail: As I have studied, deciding regularity of context-free languages is undecidable. However, we can test for regularity using the Myhill–Nerode theorem which provides a necessary and sufficient condition. So the problem should be decidable. Where is my mistake? Asked Read More …

Problem Detail: I have recently been asked in an interview to devise an algorithm that divides a set of points in a coordinate system so that half of the points lie on one side of the line, and the rest on Read More …