Author: ignougroup

Problem Detail: I just started reading a book called Introduction to Data Compression, by Guy E. Blelloch. On page one, he states: The truth is that if any one message is shortened by an algorithm, then some other message needs to Read More …

Problem Detail: I have the following formal grammar: $$G= ({S,A,B},{a,b},R,S)$$ $$R={S rightarrow A |B, A rightarrow varepsilon | aA |bA, B rightarrow varepsilon |Bb | b}$$ Now, we see, the production rules $A rightarrow varepsilon$ and $B rightarrow varepsilon$ implies that Read More …

Problem Detail: The only examples I’ve seen use bits as a measurement of entropy, but all these examples happen to use binary code alphabets. If we wanted to see how well a coding with a code alphabet of length n works, Read More …

Problem Detail: Is the complement of a Non-Recognizable language Recognizable Non-Recognizable May be Recognizable, May be Non-recognizable. I.e cant comment. A mathematical proof would be of great help since im unable to think of any way to prove this. I did Read More …

Problem Detail: I have an array of positive integers, $A = (a_1, a_2, …, a_n)$. Let $s(A)$ denote the sum of elements of array $A$. I also have an integer $t$, such that $1 < t le s(A)$. I want to Read More …

Problem Detail: This is a snippet from some pseudocode for a sorting algorithm. In it, the symbol ← is used to denote assignment, for example for the variable done. However, in the while loop the statement done:= false is written. I Read More …

Problem Detail: Consider the following program: const int n = 50; int tally; void total() { int count; for (count = 1; count <= n; count++){ tally++; } } void main() { tally = 0; parbegin (total (), total ()); write Read More …

Problem Detail: I have in mind a particular 3D object. Given an image taken by a camera, I want to check whether that image contains an instance of my object. For instance, let’s say that the object is a bathroom sink. Read More …

Problem Detail: I have an assignment where i need to create a Turing machine that decides an infinite language $Lsubset {0,1}^*$ for which all $L’subseteq L$, if $|L’|=infty$, then $L’$ is not a regular language. I think this is not possible Read More …

Problem Detail:  This is a problem from Interview Street in Dynamic Programming section. https://www.interviewstreet.com/challenges/dashboard/#problem/4f2c2e3780aeb Billboards(20 points) ADZEN is a very popular advertising firm in your city. In every road you can see their advertising billboards. Recently they are facing a Read More …