IgnouGroup Social Campus
Problem Detail: In my program, it draws them by offsetting every other row by half of the width, as pictured above. Each tile can be referenced by coordinates, also shown above. I want to know how many blue tiles are Read More …
Problem Detail: I’m studying binomial heaps. A book tells me that insertion of a node to a binomial heap take $Theta(log n)$ time. So given an array of $n$ elements it would take $Theta(n log n)$ time to convert it to Read More …
Problem Detail: I’m reading about the Hindley-Milner typing algorithm while writing an implementation, and see that, as long as every variable is bound, you’ll always get either atomic types or types where the arguments will determine the final type, such as Read More …
Problem Detail: I’m looking for mathematical theories that deal with describing formal languages (set of strings) in general and not just grammar hierarchies. Asked By : mtanti Answered By : Raphael There are plenty of possibilities. Others have already mentioned automata which offer Read More …
Problem Detail: Let $B$ be a boolean formula consisting of the usual AND, OR, and NOT operators and some variables. I would like to count the number of satisfying assignments for $B$. That is, I want to find the number of Read More …
Problem Detail: I was wondering when languages which contained the same number of instances of two substrings would be regular. I know that the language containing equal number of 1s and 0s is not regular, but is a language such as Read More …
Problem Detail: I am reading a book on a computer science topic but lack some of the prerequisite background. Normally when I run into terms I don’t understand I simply look them up, but for Universal Search I simply haven’t been Read More …
Problem Detail: In the discussion around this question, Gilles mentions correctly that any correctness proof of an algorithm that uses arrays has to prove that there are no out-of-bounds array accesses; depending on the runtime model, this would cause a runtime Read More …
Problem Detail: On Wikipedia, an implementation for the bottom-up dynamic programming scheme for the edit distance is given. It does not follow the definition completely; inner cells are computed thus: if s[i] = t[j] then d[i, j] := d[i-1, j-1] // Read More …
Problem Detail: In the pure lambda calculus, we have the inductively defined set of terms (the grammar): $$e::= x mid lambda x . e mid e_1 e_2$$ Under the call-by-value evaluation strategy, we have the inference rules for beta-reduction and rules Read More …
