Category: Uncategorized

Problem Detail: Frankly I’m very uncomfortable with the material right now. There are some things I can understand, but many I still do not. My first assignment is asking me in one question (which I do know how to do) to Read More …

Problem Detail: Suppose we are given an array of positive integers $P = [p_1, p_2, dots, p_N]$ where each $p_i$ represents the price of a product on a different day $i = 1 dots N$. I would like to design an Read More …

Problem Detail: How do we find all equivalence classes of $mathsf{R_L}$ for a language? Say I’m trying to look for all equivalent classes for the regular language $mathsf{L}$ is $011(0+1)^*011$. Here’s an example they give us in the book http://books.google.com/books?id=VEHYzv0GHt8C&pg=PA73&lpg=PA73&dq=ding+du+example+2.51&source=bl&ots=P8gAls0z7f&sig=HIsMb7rcD3hKZHYzi8fYZsyrLQ8&hl=en&sa=X&ei=5N0nUfSoJ6We2gWOv4HYDQ&ved=0CDMQ6AEwAA ps Read More …

Problem Detail: I am working on a diagram editor. Diagrams display 2D shapes (nodes) connected with connectors (edges). I’d like to add an operation that, given a selection of nodes, “disentangles” them: it repositions them to reduce the number of crossing Read More …

Problem Detail: Using the Shortest-Seek-Time-First (SSTF) disk scheduling algorithm (where we select a request with a minimum seek time from the current head position), what happens if the requests in both directions from the current head position are equal? For example, Read More …

Problem Detail: I have these questions from an old exam I’m trying to solve. For each problem, the input is an encoding of some Turing machine $M$. For an integer $c>1$, and the following three problems: Is it true that for Read More …

Problem Detail: Assume there exists some algorithm that solves vertex cover problem in time polynomial in terms of $n$ and exponential for $k$ with the run time that looks like this $O(k^2 55^k n^3)$. Can we claim that independent set can Read More …

Problem Detail: Current chess algorithms go about 1 or maybe 2 levels down a tree of possible paths depending on the player’s move’s and the opponent’s moves. Let’s say that we have the computing power to develop an algorithm that predicts Read More …

Problem Detail: Why in computer science any complexity which is at most polynomial is considered efficient? For any practical application(a), algorithms with complexity $n^{log n}$ are way faster than algorithms that run in time, say, $n^{80}$, but the first is considered Read More …