Author: ignougroup

Question Detail: The Kurose & Ross book uses “store-and-forward delay” as a synonym for the transmission delay of a packet over a network link. As a newcomer to computer networks, it isn’t immediately obvious to me how these two terms are Read More …

Question Detail: How many flops my brain can process, or how many GHz is a human brain capable of? Is it valid to think that each celular brain is like a small cpu? (like cuda architecture). Our brains works in parallel, Read More …

Question Detail: I am looking for practical applications of Finite State Machines like DFA, NFA, Moore, Mealy machines… It would be helpful if someone point to examples from Linux Kernel. I know that DFA is used in string matching like KMP Read More …

Question Detail: Note: I moved this question from stackoverflow.com I have an algorithmic problem where I would like to see if it can be solved in better than $O(n)$: I have given a table $T$ of $n$ elements where each element Read More …

Question Detail: As a software engineer, I write a lot of code for industrial products. Relatively complicated stuff with classes, threads, some design efforts, but also some compromises for performance. I do a lot of testing, and I am tired of Read More …

Question Detail: I have this question: Input: G(V, E) = an undirected graph, V={v1, v2, …, vn} (V = set of nodes, E = set of edges) where there is a path connecting from v1 to vn. Question: What is the Read More …

Question Detail: There are many applications where a pseudo random number generator is used. So people implement one that they think is great only to find later that it’s flawed. Something like this happened with the Javascript random number generator recently. Read More …

Question Detail: I’m trying to find an efficient method of detecting whether a given graph G has two different minimal spanning trees. I’m also trying to find a method to check whether it has 3 different minimal spanning trees. The naive Read More …

Question Detail: This is a GRE practice question. If a node in the binary search tree above is to be located by binary tree search, what is the expected number of comparisons required to locate one of the items (nodes) in Read More …