IgnouGroup Social Campus
Problem Detail: In my first algorithms class we’re creating these patterns that are supposed to model a finite state machine. We were given a task to think if we can figure out a way to detect palindromes in binary sequences (no Read More …
Problem Detail: Given a set of segments, I would like to compute the set of closed polygons inside the convex hull of the set of the end of those segments. The vertices of the polygons are the intersections of the segments. Read More …
Problem Detail: On Linux, the files /dev/random and /dev/urandom files are the blocking and non-blocking (respectively) sources of pseudo-random bytes. They can be read as normal files: $ hexdump /dev/random 0000000 28eb d9e7 44bb 1ac9 d06f b943 f904 8ffa 0000010 5652 Read More …
Problem Detail: Does the output of a parser have to be a tree or could it also be general graph? Moreover, is there any existing language or a plausible one that uses general graphs representation instead of trees for their syntax? Read More …
Problem Detail: Definition: Karp Reduction A language $A$ is Karp reducible to a language $B$ if there is a polynomial-time computable function $f:{0,1}^*rightarrow{0,1}^*$ such that for every $x$, $xin A$ if and only if $f(x)in B$. Definition: Levin Reduction A Read More …
Problem Detail: I am confused regarding the statements provided by one of our faculty regarding “Is it compulsory that every infinite set is non regular though every finite set is a regular set”. Providing this example: $$L= { 0^n 1^n | Read More …
Problem Detail: I’m looking for an (efficient) algorithm to solve the following problem: Given a string $S$ and a set of characters $M$, find the shortest string composed only of characters in $M$ that is not contained in $S$. Try as Read More …
Problem Detail: I was wondering how should I proceed in order to show that the composition of (say) two one-way functions (either weak or strong or both together) is not a one-way function? Specifically: Say $f$ and $g$ are one-way functions Read More …
Problem Detail: This is an area that admittedly I’ve always found subtle about CS and occasionally trips me up, and clearly others. recently on tcs.se a user asked an apparently innocuous question about N-Queens being NP hard, But it got downvoted Read More …
Problem Detail: It is said that computability theory is also called recursion theory. Why is it called like that? Why recursion has this much importance? Asked By : user5507 Answered By : Andrej Bauer In the 1920’s and 1930’s people were trying to Read More …
