You may have confused with the topic. So let me explain it.  In most of the computing languages , we have for and while loop. But in my example , I will declare the loop in c#.  When you decalre a for loop and while loop like this.  1.For loop   for(i=0;i&lt;10;i++)    {      //do something    }   2.While loop   int i=0;  while(i&lt;10)    {      //do something      i++;    }   From the 2 loops. When it comes to the complier , do they complie the same things?(except the int i that was declared outside the while loop.) If they don't , which one is better or more efficient?  Thanks in advance
for (i=0 ; i&lt;=10; i++) {     ..     .. }  i=0; while(i&lt;=10) {     ..     ..     i++; }   In for and while loop, which one is better, performance wise?
What and where are the stack and heap? Programming language books explain that value types are created on the stack, and reference types are created on the heap, without explaining what these two things are. I haven't read a clear explanation of this.  I understand what a stack is. But,    Where and what are they (physically in a real computer's memory)? To what extent are they controlled by the OS or language run-time? What is their scope? What determines the size of each of them? What makes one faster? How to force a web browser NOT to cache images Background  I am writing and using a very simple CGI-based (Perl) content management tool for two pro-bono websites. It provides the website administrator with HTML forms for events where they fill the fields (date, place, title, description, links, etc.) and save it. On that form I allow the administrator to upload an image related to the event. On the HTML page displaying the form, I am also showing a preview of the picture uploaded (HTML img tag).  The Problem  The problem happens when the administrator wants to change the picture. He would just have to hit the "browse" button, pick a new picture and press ok. And this works fine.  Once the image is uploaded, my back-end CGI handles the upload and reloads the form properly.  The problem is that the image shown does not get refreshed. The old image is still shown, even though the database holds the right image. I have narrowed it down to the fact that the IMAGE IS CACHED in the web browser. If the administrator hits the RELOAD button in Firefox/Explorer/Safari, everything gets refreshed fine and the new image just appears.  My Solution - Not Working  I am trying to control the cache by writing a HTTP Expires instruction with a date very far in the past.  Expires: Mon, 15 Sep 2003 1:00:00 GMT   Remember that I am on the administrative side and I don't really care if the pages takes a little longer to load because they are always expired.  But, this does not work either.  Notes  When uploading an image, its filename is not kept in the database. It is renamed as Image.jpg (to simply things out when using it). When replacing the existing image with a new one, the name doesn't change either. Just the content of the image file changes.  The webserver is provided by the hosting service/ISP. It uses Apache.  Question  Is there a way to force the web browser to NOT cache things from this page, not even images?  I am juggling with the option to actually "save the filename" with the database. This way, if the image is changed, the src of the IMG tag will also change. However, this requires a lot of changes throughout the site and I rather not do it if I have a better solution. Also, this will still not work if the new image uploaded has the same name (say the image is photoshopped a bit and re-uploaded). Can someone give me a hint how to the irreducibility of $X^{p-1} + \cdots + X+1$, where $p$ is a prime, in $\mathbb{Z}[X]$ ?    Our professor gave us already one, namely to substitute $X$ with $X+1$, but I couldn't make much of that. Colors in Photoshop CS6/CC look different than in browser? One of my friends, a graphic designer told me recently that sometimes colors in Photshop look slightly different than the ones rendered in browser.  I know it is possible when you save a file and then use it on a website due to palettes, but he uses given color in PS, for example #b81e1e, then he creates a DOM element and sets its background to #b81e1e and the color is rendered differently in browser than in PS (I guess it's not that subtle as he can easily spot it). It's not a regular thing and it doesn't happen always, but he states it happened to him a few times, although he can't really tell me with witch colors.    Is it even possible? Because I have never really heard about anything like this &amp; nothing like this ever happened to me... Why does strcmp() return 0 when its inputs are equal? When I make a call to the C string compare function like this:  strcmp("time","time")  It returns 0, which implies that the strings are not equal.  Can anyone tell me why C implementations seem to do this? I would think it would return a non-zero value if equal. I am curious to the reasons I am seeing this behavior. Layover at Narita, Japan. Do I need a transit visa? I will be transferring between two international flights at Tokyo Narita airport. I'm scheduled to depart the same day I arrive. I am planning to stay within the airport during the layover. Does anyone know if I will require a transit visa at Narita? Does there exist a continuous bijection from $(0,1)$ to $[0,1]$? Of course the map should not be a proper map. Add the ability to ignore users Differences between Verb + to be + adjectives and Verb + adjective Reading/Writing a MS Word file in PHP Is it possible to read and write Word (2003 and 2007) files in PHP without using a COM object? I know that I can:  $file = fopen('c:\file.doc', 'w+'); fwrite($file, $text); fclose();   but Word will read it as an HTML file not a native .doc file. May I use a question mark in the middle of a sentence? Examples:  Would you like the drapes to be white? or perhaps something off-white? Would you like the logo to be centered? at the bottom? left off entirely? Proving square root of a square is the same as absolute value Lets say I have a function defined as $f(x) = \sqrt {x^2}$. Common knowledge of square roots tells you to simplify to $f(x) = x$ (we'll call that $g(x)$) which may be the same problem, but it isn't the same equation. For example, say I put $-1$ into them:  $\begin{align} f(x) &amp;= \sqrt {x^2} \\ f(-1) &amp;= \sqrt {(-1)^2} \\ f(-1) &amp;= \sqrt {1} \\ f(-1) &amp;= 1 \end{align}$  $\begin{align} g(x) &amp;= x \\ g(-1) &amp;= -1 \end{align}$  thereby, we conclude that $f(x)$ and $g(x)$ do not produce the same results even though they are mathematically the same. This is also shown when we try to graph the functions:  :    :    :    From this, we can see that given $f(x) = \sqrt {x^2}$, when simplified is not the same as $f(x) = x$. So, is there any way to prove that $y = \sqrt {x^2}$ is not the same as $y = x$ for negative values, but is infact the same as $y = \mid x \mid$? In chapter 2, the section on bitwise operators (section 2.9), I'm having trouble understanding how one of the sample methods works.  Here's the method provided:  unsigned int getbits(unsigned int x, int p, int n) {     return (x &gt;&gt; (p + 1 - n)) &amp; ~(~0 &lt;&lt; n); }   The idea is that, for the given number x, it will return the n bits starting at position p, counting from the right (with the farthest right bit being position 0). Given the following main() method:  int main(void) {     int x = 0xF994, p = 4, n = 3;     int z = getbits(x, p, n);     printf("getbits(%u (%x), %d, %d) = %u (%X)\n", x, x, p, n, z, z);      return 0; }   The output is:     getbits(63892 (f994), 4, 3) = 5 (5)   I get portions of this, but am having trouble with the "big picture," mostly because of the bits (no pun intended) that I don't understand.  The part I'm specifically having issues with is the complements piece: ~(~0 &lt;&lt; n). I think I get the first part, dealing with x; it's this part (and then the mask) that I'm struggling with -- and how it all comes together to actually retrieve those bits. (Which I've verified it is doing, both with code and checking my results using calc.exe -- thank God it has a binary view!)  Any help? Update: Failed to lock /var/cache/apt/archives/lock I am running the upgrade(12.10 to 13.04) through terminal and it keeps getting stuck at this:  Failed to lock /var/cache/apt/archives/lock   What do I do? I have root access. I have no idea what else to try other than a clean install.  Checking package manager Reading package lists... Done     Building dependency tree           Reading state information... Done Building data structures... Done   Calculating the changes Calculating the changes  Do you want to start the upgrade?   3 packages are going to be removed. 155 new packages are going to be  installed. 1204 packages are going to be upgraded.   You have to download a total of 595 M. This download will take about  1 hour 15 minutes with a 1Mbit DSL connection and about 23 hours with  a 56k modem.   Fetching and installing the upgrade can take several hours. Once the  download has finished, the process cannot be canceled.    Continue [yN]  Details [d]y  Fetching  Could not download the upgrades   The upgrade has aborted. Please check your Internet connection or  installation media and try again. All files downloaded so far have  been kept.   Failed to lock /var/cache/apt/archives/lock    Restoring original system state  Aborting Reading package lists... Done     Building dependency tree           Reading state information... Done Building data structures... Done  root@chaitanya-XPS-Ubuntu:~# Clicking leave closed shows the reopen pop-up Can I get a rebate after using my HSA? I'm trying to use ARIMA process to predict the behaviour of a time series, the probleme I face is that I can't get the order of each component of ARIMA, the lag is between 0 and 1, same goes for the acf. The time series has no tendency, and I guess no seasonality.     My question is : Does this mean that ARIMA orders are all 0s, and if so, is the HoltWinters a good (or the best) solution for modelling this kind of TS ? The expression 'not that bad of a' In an essay, a friend used the expression:       It wasn't that bad of an idea.    I think that it would be preferable to write       It wasn't that bad an idea   However, I can't explain why. I accidentally closed the window for the verfication code I wanted to create an account for Ubuntu One, but I got impatient when the email with the verification code didn't arrive... I thought I might have typed the wrong address, closed the window and tried again. it told me the address already existed and I just got the code. But since I closed the window I missed it. Is there any way to recover the code? Can PostGIS and QGIS provide dependable multi-user editing? After considering a few options, I'm trying to give my 15-20 QGIS 2.2 users the ability to concurrently view/edit one or two basic point PostGIS layers, largest one has just 16,000 records. I've installed PostgreSQL 9.1 / PostGIS 2.0 and basic testing seems to work ok but haven't unleashed it to the masses yet.  We'll typically only have 2-3 editors at a time, but possibly 15 viewers. Edits will all be in QGIS, viewers will be QGIS and ArcGIS (but we don't have SDE).  As I said, these are just basic point files, and  edits will just be adding/deleting points and some table edits. I am not worried about editing the same features at the same time.  Can the combination provide dependable multi-user editing for two basic point files?