IgnouGroup Social Campus
Problem Detail: I already understood how the well-known algorithms like Graham, Quickhull etc. work, but i have difficulties in understanding 2 naive versions of convex hull algorithms: Let S={p1, …, pn} a set of points and CH(S) the convex hull of Read More …
Problem Detail: To prevent collisions, hash tables with open addressing use a methodology to chain the contents. Why can’t we use another hash table allocated to each slot of the primary hash table? Asked By : user1675999 Answered By : jbapple The method Read More …
Problem Detail: Bruinier and Ono have found an algebraic formula for the partition function, which was widely reported to be a breakthrough. I am unable to understand the paper, but does it have any algorithmic consequences for fast computation of the Read More …
Problem Detail: I’m learning programming in ML (OCaml), and earlier I asked about ML functions of type ‘a -> ‘b. Now I’ve been experimenting a bit with functions of type ‘a list -> ‘b list. There are some obvious simple examples: Read More …
Problem Detail: I’m designing an in-memory object database for a very specific use case. It is single writer, but must support efficient concurrent reads. Reads must be isolated. There is no query language, the database only supports: get object/-s by attribute/set Read More …
Problem Detail: I have encountered the following problem that I found very interesting to solve: Given an array of positive integers ${a_1, a_2, …, a_n}$ you are required to partition the array into $3$ blocks/partitions such that the maximum of sums Read More …
Problem Detail: I am trying to solve the following problem: Given a matrix which consists of only 0’s and 1’s. Considering the matrix as a metal sheet, we need to “cut-out” square blocks of sizes 2×2 consisting of only 0’s from Read More …
Problem Detail: I’m still fairly new to Turing Machines, but I’ve been doing some research. I know that a Turing Machine can have an infinite tape and that it requires a finite number of states, but does it necessarily follow that Read More …
Problem Detail: Consider the following language: $$ L_1={uu^rv mid u,vin{0,1}^+}.$$ that means that neither $u$ nor $v$ can be $varepsilon$. As usual $u^r$ refers to $u$ reflected. I think that this language is not regular, but i am not sure. Any Read More …
Problem Detail: I (will, at the end) have a connected, undirected graph with N nodes and 2N-3 edges. You can consider the graph as it is built onto an existing initial graph , which has 3 nodes and 3 edges, iteratively. Read More …
