Author: ignougroup

Problem Detail: What follows is my algorithm for doing this in what I believe to be $O(n)$ time, and my proof for that. My professor disagrees that it runs in $O(n)$ and instead thinks that it runs in $Omega(n^2)$ time. Any Read More …

Problem Detail: Introduction to Algorithms, 3rd edition (p.95) has an example of how to solve the recurrence $$displaystyle T(n)= 3Tleft(frac{n}{4}right) + ncdot log(n)$$ by applying the Master Theorem. I am very confused by how it is done. So, $a=3, b=4, f(n) Read More …

Problem Detail: I know that Translation look aside buffer is used for address translation in paging to achieve better performance. I came across term called Look Ahead buffer in a document which said it implements Temporal locality. I tried searching for Read More …

Problem Detail: I’m currently working on my masters thesis, and it’s about clustering on graphs. I’m working with an idea using ants to solve the problem. I’m currently working on the implementation and am wondering exactly how well to represent the Read More …

Problem Detail: I’m trying to implement the Pastry Distributed Hash Table, but some things are escaping my understanding. I was hoping someone could clarify. Disclaimer: I’m not a computer science student. I’ve taken precisely two computer science courses in my life, Read More …

Problem Detail: I’m wondering if somebody can please help me to understand how I go about converting this grammar to an unambiguous grammar. If you can point me in the right direction, I would greatly appreciate it. S -> AB | Read More …

Problem Detail: Before reading The Art of Computer Programming (TAOCP), I have not considered these questions deeply. I would use pseudo code to describe algorithms, understand them and estimate the running time only about orders of growth. The TAOCP thoroughly changes Read More …

Problem Detail: Whats the diffrence between Disk scheduling and process scheduling? I mean i know the roles of disks and processes, but it seems to me they both have the same aim. to reduce monopolies, they even both share similar algorithms Read More …

Problem Detail: Problem: Given an array of $n$ integers, $A[1 dots n]$, such that any integer occurs at most 2 times in the array, we have to find the number of unique increasing subsequences of length 3 (duplicate subsequences must be Read More …