IgnouGroup Social Campus
Problem Detail: Consider how one would represent the following image in vector graphics: Pretty simple, right? The entire shape can be represented by a single path element. But suppose additionally that you want to color the heart at the top red. Read More …
Problem Detail: Lets $L_z := { a^i b^i c^i : 0 leq i < z }$ ${a,b,c} in sum^*$ there is a DFA with $frac{z(z+1)}{2}+1$ states – How can I prove this? And I need largest possible number $n_z$, for which Read More …
Problem Detail: I was solving this question. It is as follows Joe picks an integer from the list $1,2,cdots,N$ with a probability $p_i$ of picking $i$ for all $1leq i leq N$. He then gives Jason $K$ attempts to guess his Read More …
Problem Detail: AB 00 01 11 10 00 | x | 1 | 0 | 1 | CD 01 | 0 | 1 | x | 0 | 11 | 1 | x | x | 0 | 10 | Read More …
Problem Detail: One of my courses introduced the following question: Given the recurrence relation for mergesort: $T(n) = 2T(n/2) + n$ How would the following parameter passing strategies influence the relation and running time of the algorithm: A pointer to the Read More …
Problem Detail: $L = left { epsilon right }$ Clearly this language is finite so this must be a regular language. Now since every regular language is Context Sensitive, $L$ is a CSL. We can define the grammar for $L$ as Read More …
Problem Detail: You and a friend lost each other on the line to a concert, and neither is sure which of you is further ahead. Formally, each is at some integer coordinate and may only walk towards a higher coordinate or Read More …
Problem Detail: Given three strings $x$, $y$, and $z$ over an arbitrary finite alphabet, I need to determine their longest common subsequence (LCS). Example: A longest common subsequence of bandana, cabana, and magazine is aan. I’m trying to find an algorithm Read More …
Problem Detail: I have a rough idea that the time complexity is O(mn) where m and n are based on the length of signals, as per this http://en.wikipedia.org/wiki/Dynamic_time_warping. How can I determine the time complexity of the following code (source) function Read More …
Problem Detail: The paragraph on V-opt heuristic TSP algorithms at this site mentions a very effective algorithm due to Lin-Kernigham-Johnson. That page says: For many years Lin–Kernighan–Johnson had identified optimal solutions for all TSPs where an optimal solution was known and Read More …
