Author: ignougroup

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: Simply put, if one were to build a quantum computing device with the power of, say, 20 qubits, could such a computer be used to make any kind of modern hashing algorithm useless? Would it even be possible to Read More …

Problem Detail: I’ve been reading Linear Algebra and its Applications to help understand computer science material (mainly machine learning), but I’m concerned that a lot of the information isn’t useful to CS. For example, knowing how to efficiently solve systems of Read More …

Problem Detail: I was just thinking today that the best approach to find two smallest numbers in any array would be to first sort(ascending order) it with some efficient algorithm like Quicksort(Average case complexity: nlogn) and then access the first two 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 …