Problem Detail: We want an algorithm that, given an array of length $n$ of integers, find the minimum difference between two integers in the array. One such algorithm is to sort the array and check adjacent pairs of numbers. This takes Read More …
Category: Uncategorized
How to interpret “Windows – Virtual Memory minimum too low” from a CS student point of view?
Problem Detail: On my old 256MB RAM, pc I get this message. (I guess it is quite common) Windows – Virtual Memory minimum too low Your system is low on virtual memory. Windows is increasing the size of your virtual memory Read More …
Subtracting an integer from an ASCII number
Problem Detail: Theoretically, if I were to subtract the number 10 from the ASCII character 10 (which is really 00110001 00110000), what would I get? Does the computer add both ASCII characters and subtract? Asked By : CodyBugstein Answered By : vonbrand If Read More …
Equivalence of independent set and set packing
Problem Detail: According to Wikipedia, the Independent Set problem is a special case of the Set Packing problem. But, it seems to me that these problems are equivalent. The Independent Set search problem is: given a graph $G(V,E)$ and an integer Read More …
MIPS Architecture : PC-relative addressing
Problem Detail: In case of branch Instructions such as beq, bne, we use PC-relative addressing. But I am really not clear why it is said in most of the books that MIPS address(while calculating branch target) is actually relative to the Read More …
Why is unification so important to inference engines?
Problem Detail: I am learning Automated Theorem Proving / SMT solvers / Proof Assistants by myself and post a series of questions about the process, starting here. I keep reading about the Unification Algorithm. What is it and why is so Read More …
Non-deterministic Turing machine that halts on at least one branches of computation
Problem Detail: I’m looking at my textbook here from Michael Sipser and he says that a nondeterministic Turing machine is a decider if all its computation branches halt on all inputs. I think I recall seeing somewhere what you’d call a Read More …
Infinite calculations in finite time
Problem Detail: This is probably a silly thought, but suppose we have a computer that’s programmed to perform an infinite sequence of calculations and suppose the $i^text{th}$ calculation takes $1/2^i$ seconds to complete. Then this computer can do an infinite number Read More …
Understanding the basic concepts in memory organisation
Problem Detail: (Before actually proceeding to the question, I want to confess that this is a homework question, please do consider it and help me in improving my understanding a bit more.) I have recently started learning computer organisation and architecture. Read More …
What is the intuition behind the Potential Function in Amortized Analysis of some algorithm?
Problem Detail: I have come across many amortized analysis using a potential function. They all look magical to me. Everything works perfectly but I never got the intuition behind how they come up with such a “magical” potential function which makes Read More …