Question Detail: I know that the both the average and worst case complexity of binary search is O(log n) and I know how to prove the worst case complexity is O(log n) using recurrence relations. But how would I go about Read More …
Author: ignougroup
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 …
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 …
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 …
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 …
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 …
Is Morse Code binary, ternary or quinary?
Question Detail: I am reading the book: “Code: The Hidden Language of Computer Hardware and Software” and in Chapter 2 author says: Morse code is said to be a binary (literally meaning two by two) code because the components of the Read More …
