IgnouGroup Social Campus
Problem Detail: I have been attempting to get my mind around the Kuhn-Munkres/Hungarian Algorithm. I have been using the following statement of the algorithm which I found here. Based on my readings on the algorithm, my understanding is that the improvement Read More …
Problem Detail: As I understand, to show that a certain problem $P$ is NP-hard we can reduce a known NP-hard problem $Q$ to a problem in $P$. This reduction, say $f$, has to be polynomial time. Could someone please explain is Read More …
Problem Detail: It’s well-known that this ‘naive’ algorithm for shuffling an array by swapping each item with another randomly-chosen one doesn’t work correctly: for (i=0..n-1) swap(A[i], A[random(n)]); Specifically, since at each of $n$ iterations, one of $n$ choices is made (with Read More …
Problem Detail: I have a question whether or not CSS and HTML are regular languages. I believe CSS is a regular language, since it should be possible to create a regular expression to match the structure of CSS. However, I believe Read More …
Problem Detail: Is there a difference between perfect, full and complete tree? Or are these the same words to describe the same situation? Asked By : John Swoon Answered By : Yuval Filmus These words don’t have a standard definition. A full binary Read More …
Problem Detail: I have seen a way how to convert a decimal number to BCD (packed & unpacked) using 8,4,2,1 weighing forms but how to do it using 4,2,2,1 and 7,4,2,1 ? Any method please.Suggestions Asked By : tonny Answered By : Totoro Read More …
Problem Detail: I was practicing the following problem : There are a total of $N$ operations. At each operation, you can either add an element to the top or remove several elements as described below. Inputs are integers. An input other Read More …
Problem Detail: In the standard proof why Subset-Sum is (weakly) NP-complete, one reduces Vertex Cover to Subset-Sum by using suitable numbers with O(m+n) bits (where m is the number of edges and n the number of vertices). But how can we Read More …
Problem Detail: I am new to artificial intelligence. I have been trying to analyse the time complexity of 8-queen, by placing one by one without attack. One approach to achieve goal state is to “add a queen to any square in Read More …
Problem Detail: Basically, I believe that if you have something like a .dmg file the OS opens it with a certain program which takes the code behind it and does things to it. So why couldn’t you then take the program Read More …
