IgnouGroup Social Campus
Problem Detail: I’ve been working on this graph and just completely botching it. I mean to say that my solution may be the worst possible other than if a monkey had thrown darts at the graph to decide the next path. Read More …
Problem Detail: Do you know any easy to implement algorithm for constructing a Voronoi diagram from a given set of points on a surface, using some different metric (taxicab, for instance)? It can be some modification of Fortune’s algorithm. Asked By Read More …
Problem Detail: What does it mean exactly a “uniform shuffle” algorithm ? Is this method considered a uniform shuffle ? public void shuffle(Comparable[] a) { int n = a.length; int k, j; for (int i = 0; i < n; i++) Read More …
Problem Detail: In my computer organization class I have been given a series of problems. One I’m stuck on currently is below: Assume that $X$ consists of 4 bits, $x_3 x_2 x_1 x_0$, and $Y$ consists of 4 bits, $y_3 y_2 Read More …
Problem Detail: I’m not a student in computer science, but from what I understand from the Wikipedia article on the topic, a programming language is Turing complete if it can emulate another Turing complete language’s algorithm. Now if we consider that Read More …
Problem Detail: This is inspired by an interview question. We are given an array of integers $a_1, dots, a_n$ and have to determine if there are distinct $i lt j lt k$ such that $a_k – a_j = a_j – a_i$ Read More …
Problem Detail: I’m starting my mater’s thesis in computer science. I’m interested in computational Origami (algorithms mainly); I’ve read a little about the subject and I’m worried because I lack some of the knowledge that I think is necessary to do Read More …
Problem Detail: Let $mathrm{L} in mathrm{NTIME}(n^3)$. Since $mathrm{NTIME}(n^3) subseteq mathrm{NP}$, we have that $mathrm{L} le_p mathrm{3SAT}$. However, $mathrm{3SAT} in mathrm{NTIME}(n)$. Hence, $mathrm{L} in mathrm{NTIME}(n)$. Thus, $mathrm{NTIME}(n^3)subseteq mathrm{NTIME}(n)$ which implies the non-deterministic time-hierarchy is false. But we all know that time hierarchy Read More …
Problem Detail: I was just researching Fibonacci encoding of integers. Numbers are encoded in binary and where no two consecutive bits are equal to 1 – other than to terminate the number. Now other schemes are possible, for example having three Read More …
Problem Detail: Say I have part of a query in the form: ∃xa(…)∧∃xb(…)∧∃xc(…), where a, b, and c are attributes and the ellipses can be anything (I’m looking for a general rule). Is this equivalent to saying ∃xa,xb,xc(…∧…∧…) – i.e. compacting Read More …
