Question Detail: I tried this problem from CLRS (Page 39, 2.3-4) We can express insertion sort as a recursive procedure as follows. In order to sort A[1… n], we recursively sort A[1… n-1] and then insert A[n] into the sorted array Read More …
Category: Uncategorized
Recurrence for recursive insertion sort
Question Detail: I tried this problem from CLRS (Page 39, 2.3-4) We can express insertion sort as a recursive procedure as follows. In order to sort A[1… n], we recursively sort A[1… n-1] and then insert A[n] into the sorted array Read More …
Knapsack problem — NP-complete despite dynamic programming solution?
Question Detail: Knapsack problems are easily solved by dynamic programming. Dynamic programming runs in polynomial time; that is why we do it, right? I have read it is actually an NP-complete problem, though, which would mean that solving the problem in Read More …
What is meant by interrupts in the context of operating systems?
Question Detail: I’ve decided to read Operating Systems Concepts by Silberschatz, Galvin Gagne (8th edition) over the summer. I’ve gotten to a topic that’s confusing me – interrupts and their role as it relates to operating systems. The text says that Read More …
What is an asymptotically tight upper bound?
Question Detail: From what I have learned asymptotically tight bound means that it is bound from above and below as in theta notation. But what does asymptotically tight upper bound mean for Big-O notation? Asked By : nangal.vivek Best Answer from StackOverflow Read More …
Finding the max XOR of two numbers in an interval: can we do better than quadratic?
Question Detail: Suppose we’re given two numbers $l$ and $r$ and that we want to find $max{(ioplus j)}$ for $lle i,,jle r$. The naïve algorithm simply checks all possible pairs; for instance in ruby we’d have: def max_xor(l, r) max = Read More …
The amount of ROM needed to implement a 4-bit multiplier?
Question Detail: For a 4-bit multiplier there are $2^4 cdot 2^4 = 2^8$ combinations. The output of 4-bit multiplication is 8 bits, so the amount of ROM needed is $2^8 cdot 8 = 2048$ bits. Why is that? Why does the Read More …
What is the depth of a complete binary tree with $N$ nodes?
Question Detail: This question uses the following definition of a complete binary tree†: A binary tree $T$ with $N$ levels is complete if all levels except possibly the last are completely full, and the last level has all its nodes to Read More …
How can it be decidable whether $pi$ has some sequence of digits?
Question Detail: We were given the following exercise. Let $qquad displaystyle f(n) = begin{cases} 1 & 0^n text{ occurs in the decimal representation of } pi 0 & text{else}end{cases}$ Prove that $f$ is computable. How is this possible? As far as Read More …
Is Dijkstra’s algorithm just BFS with a priority queue?
Question Detail: According to this page, Dijkstra’s algorithm is just BFS with a priority queue. Is it really that simple? I think not. Asked By : Barry Fruitman Best Answer from StackOverflow Question Source : http://cs.stackexchange.com/questions/10047 Answered By : Shaull You can implement Dijkstra’s Read More …
