Blog

Question Detail: We know post-order, post L(x) => [x] post N(x,l,r) => (post l) ++ (post r) ++ [x] and pre-order pre L(x) => [x] pre N(x,l,r) => [x] ++ (pre l) ++ (pre r) and in-order traversal resp. sequentialisation. in Read More …

Question Detail: As I understand, the assignment problem is in P as the Hungarian algorithm can solve it in polynomial time – O(n3). I also understand that the assignment problem is an integer linear programming problem, but the Wikipedia page states Read More …

Question Detail: When a computer stores a variable, when a program needs to get the variable’s value, how does the computer know where to look in memory for that variable’s value? Asked By : MCMastery Best Answer from StackOverflow Question Source : http://cs.stackexchange.com/questions/64578 Read More …

Question Detail: I’m having a hard time with the following question: Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n) = 4T(n/2 + 2) + n$. Use the substitution method to verify your answer. This Read More …

Question Detail: I am trying to learn some basic benchmarking. I have a loop in my Java program like, float a=6.5f; int b=3; for(long j=0; j<999999999; j++){ var = a*b+(a/b); }//end of for My processor takes around 0.431635 second to process Read More …

Question Detail: This may be a ridiculous question, but is it possible to have a problem that actually gets easier as the inputs grow in size? I doubt any practical problems are like this, but maybe we can invent a degenerate Read More …

Question Detail: Everyone knows computing speed has drastically increased since their invention, and it looks set to continue. But one thing is puzzling me: if you ran an electrical current through a material today, it would travel at the same speed Read More …

Question Detail: You are given an array of $2n$ elements $$a_1, a_2, dots, a_n, b_1, b_2, dots b_n$$ The task is to interleave the array, using an in-place algorithm such that the resulting array looks like $$b_1, a_1, b_2, a_2, dots Read More …

Question Detail: Context-free languages are not closed under complementation. In the lectures we have been given the same argument as here on Wikipedia. But this only shows that one of the three languages $A$, $B$, and $overline A cup overline B$ Read More …