Problem Detail: Suppose I have a function $f$ on sets. What is the property of $f$ called when, for all sets $x$, $y$: $f(x)$ is a superset of $f(y)$ when $x$ is a superset of $y$ i.e. $$forall x,y : xsupseteq Read More …
Category: Uncategorized
[Solved]: Bellman-Ford parent pointer (?) negative cycle
Problem Detail: First of all, let me preface by saying that this question is not completly new but the original question hasn’t been answered. More important, this is only basic question on understanding the proof itself. So after some search in Read More …
[Solved]: How do you find out with a DCEL if the face is to the right of a vertex?
Problem Detail: I would like to find for any given vertex in a polygon stored in a doubly-connected edge list if the polygon is to its right or not. How do I do that without having a bunch of nested if Read More …
[Solved]: Distribution algorithm according to weighted parameters (with a min-max constraint)
Problem Detail: I’m trying to solve the following problem related to distribution- I have a list L of items (I1, I2,….In) sorted in order of importance, I1 being the most important. Each item has multiple tags assigned to it and the Read More …
[Solved]: How do I tell if a comparison network sorts?
Problem Detail: I am presented with a comparison network. How can I determine if the comparison network is a sorting network? In the image below there is an example of a selection sort and insertion sort network. The intent is to Read More …
[Solved]: Understanding a proof in the sweep line algorithm when finding all line segment intersections
Problem Detail: You have a set of line segments and you want to find all intersections. First sweep line approach: Use a priority queue Q for the events as they come, where each event is just an end point of a Read More …
[Solved]: Show that the pumping lemmas for context-free and regular languages are equivalent for unary languages
Problem Detail: I want to show that for any language $L subseteq { a }^* $, $L$ satisfies the pumping lemma for context free languages if and only if it satisfies the pumping lemma for regular languages. I know that every Read More …
[Solved]: Can we compute the sum of a range of entries in $O(1)$ time?
Problem Detail: I have encountered a few tests in algorithms which ask for a data structure which allows to get the sum of all the elements of an array in the range [i..j], in O(1) time. Is it even possible to Read More …
[Solved]: What do I need to study in order to understand and design a programming language?
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 …
[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 …
