Author: ignougroup

Problem Detail: Is there a data structure to keep track of the connected components of a dynamic graph, when the graph might by changing by deleting edges of the graph? Let $G$ be an undirected graph. I have two operations I’d Read More …

Problem Detail: I’m trying to backfill missing CS knowledge and going through the MIT 6.006 course. It asks me to rank functions by asymptotic complexity and I want to understand how they should be reduced rather than just guessing. The question Read More …

Problem Detail: A soft question, when I was in high school and in University I took scientific writing classes and people told me I should use passive voice as much as possible to sound objective, but when I entered grad school Read More …

Problem Detail: I’ll phrase my question using an intuitive and rather extreme example: Is the expected compression ratio (using zip compression) of a children’s book higher than that of a novel written for adults? I read somewhere that specifically the compression Read More …

Problem Detail: How do you find the minimum hamming distance of a code? A naive way is computing the distance of each pair of codewords in our code. It becomes hard when the code is sufficiently large. Is there a formula Read More …

Problem Detail: When we say that in random graph we add an edge with a certain fixed probability, what do we actually mean? For example if probability is 0.5, does that mean that we can just add two edges in a Read More …

Problem Detail: The problem is to select the minimum number of nodes from a graph such that, the selected nodes and their neighbors consists of all the nodes of the graph. Any straight forward algorithm for this? Repeatedly selecting the node Read More …

Problem Detail: What does $log^{O(1)}n$ mean? I am aware of big-O notation, but this notation makes no sense to me. I can’t find anything about it either, because there is no way a search engine interprets this correctly. For a bit Read More …

Problem Detail: I am trying to understand how PCA works, and think I got most of it except… By calculating eigenvalues/vectors of the covariance matrix of the original dataset allows to find those dimensions where data is least correlated (lowest covariance). Read More …

Problem Detail: I’m a teacher assistant in my university and my next topic is recursion. what way is the best to teach recursion so that the student can grasp the concept easily and can think recursively? I was thinking about explaining Read More …