what is the difference between far and huge pointer?
450253
A far pointer is 1100 miles away.\nyou can't walk around a huge pointer.
950705
In minicomputer O/S the no of procceses in one second is far much lower than that of a main frame. mainframes can operate in terms of tera bytes while minicomputers operate in terms of up to gigabits.\n\nits like comparing win vista and win 3.0 you can't run win 3.0 on a pentium 4 3.1 ghz it will be degrading your pc!
257370
There are a number places in the C++ spec that say that the method of implementation is left up to the designer of the compiler as long as they meet certain requirement.\n\nFor example, the rules require that the storage size of a long be at least as large as that for an int.\nMicrosoft C++ makes both ints and longs 32 bits. A program that works with 32 bit longs could very easily fail with 16 bit longs and vice versa. \n\nIt's also possible that you are breaking a rule that you can get away with on with one compiler, but not the other. For example, if you are running a program built with MS C++ using debug heap allocation, when you free the memory, it gets overwritten with a specific pattern to aid in debugging. If you use a stale pointer, you'll be pointing to trash. The same code built using another compiler might still find valid values in the memory, even though you released it.
24430
It's a memory leak.  A type of bug.  When the program uses a section of memory, it never gives it up when its done - so eventually it expands to include all of your usable space.\n\nFile a bug complaint and wait for a patch.
497692
16 and 32bit programs (OS, programming) can be considered in many issues;\nas C, C++, assembly, ... (not high level languages) programmer basically you can address different size of memory in each schemes:\n1) In 16bit programs, every "int" variable is 16bit long, so 2^16 bytes of memory can be accessed. (there were different memory models those-days: huge, far)\n2) in the same way every "int" in a 32bit programs is 32bit long and thus 2^32 bytes of memory handled.\n\nalso your program in runtime is tightly dependent of the OS and hardware architecture (they could be 16, 32 or even 64bit)\n\nOther programming issues (in practice) rise up when you want to switch between 16 and 32bit programming, eg Multithreading & synchronization, I/O addressing, ... which are OS and hardware dependent.
744989
A program sets aside an allocated chunk of memory, called a buffer.  The size of the buffer is typically calculated to allow some time to pass before incoming data fills it.  If the data comes in faster than anticipated, or the buffer is too small, than the buffer "overflows" and data is lost.
293579
There is no functional difference.  Its all just preference.  Some people like to designate that a pointer is being used beside the data type, and others prefer to signify a point beside the variable name.  Placement of "const" shouldn't matter either.\n\nNotice that there is no functional difference in the outputs:\n\n#include <iostream>\n\nusing namespace std;\n\nint main(){\n    char d='a';\n    const char* c=&d;\n    char const *b=&d;\n    \n    cout<<c<<endl;\n    cout<<b<<endl;\n    \n    //Require for Dev-C++\n    //system("pause");\n    \n    return 0;\n}
628097
Imagine a block of memory from 0 to N. A cyclic buffer fills from 0 towards N, and when it reaches N it starts back at 0 again.\nThis kind of buffer needs to be "serviced" (have the data removed) before new data overwrites data that hasn't been removed yet.\nThere is normally an "in" pointer for incoming data, and an "out" pointer for outgoing data, If the "out" pointer reaches the "in" pointer, the buffer is empty again. If the "in" pointer reaches the "out" pointer, you've overflowed the cyclic buffer!
654265
Generically, it is an array of pointers that can change in size.  So you have a number of pointers refering to some data locations in memory, and you add and subtract pointers from the list as the program goes.
765091
Mn is close, but there are 2 errors:\n\n1) There is no len() function.  Use strlen() instead of len().\n\n2) He didn't allocate enough memory for the sprintf to fit the entire result string in the buffer.  The line needs room to store the &#92;n (or in windows, 2 chars - cr and lf ) in addition to the null terminator.  So, his code needs to add 2 instead of 1 to the length calculation.  \n\nTaking this a little further, the number of chars should be multiplied by the sizeof(t_char), which MIGHT NOT be 1 byte if the code is destined to use unicode.\n\nChances are, this is ascii, so the multiplication is unnecessary, but it is better to be safe than sorry.  Besides, if this was production code, you'd want to be able to use the same code in both places without any need to change it.  Nothing worse than having to go back and recalculate buffer manipulation code during a port.\n\nThe above subtleties demonstrate precisely how and why it is so very easy to make a mistake in c/c++, leading to a buffer underallocation or overwrite, and hence a security hole.
1044773
Memory leak detection\n\n \n\nGDI+ is using GdipAlloc and GdipFree for allocating memory for GDI+ objects. Probably they have their own memory allocation lists in gdiplus.dll, but unfortunately there is no exported API to get any memory leak information. But GDI+ objects can be located on stack (for example: creating a local variable in a function), so there is no special initialization for these memory regions, so we do not have to use GdipAlloc or GdipFree. If we call the CRT debug version of memory allocation and deletion functions instead of GdipAlloc/Free, we can detect memory leaks very easily using the well known _CrtXXX functions.
290645
1GB=1,000,000,000 (a billion bytes)\n\n1MB = 1,000,000 (a million bytes)\n\n0.4 GB = 0,400,000,000 bytes\n\nTherefore, 0.4GB ==> 400 MB
687702
A previous answer explained that "array subscripts get\ncompiled down to use pointer arithmetic".\n\nIt's not simply an implementation issue, but rather a\nlanguage definition issue.  Section 6.3.2.1 of the Ansi C\nstandard explains that except when used as the argument of\na "sizeof" or "&" operator, a reference of "array of type"\nis converted to reference of "pointer to type" which\npoints to the initial element of the array.\n\nTo use the example from the previous poster, "x[i]" is\n_defined_ to be *(x+i).\n\nTo extend the illustration (and to confuse your friends),\nconsider the following.  A character string reference is\nconverted to type "pointer to char", but since pointers\ncan be used in array context, you can reference one as\nfollows:\n\n    char c = "house"[3];\n\nBut as the other poster explained, since x[5] is \nsemantically equivalent to 5[x], the following is\nalso legal:\n\n\n    char c = 3["house"];\n\nThis, of course, equals the character value 's'.\n\n\nFinally, for those answering who are so young that \nthey think "C is the mother of all languages", you \nmight do a quick web search on the words "Fortran" \nand "Algol" :-)
688149
Of course you'll se the difference! Not mainly in speed but mostly regarding the entire ysstem stability.. The only problem is that at this time many applications are still written in 32-bit and eventualy don't support 64-bit applications. It's the only disadvantage, and I could say minor because very soon 64 bit will be the new standard for cpu processing!
263157
data types are usually specified in sizes of bytes:\nint = 4 bytes\nshort = 2 bytes\ndouble = 8 bytes, etc.  a byte data type has a size of 1 byte
881644
Something like this:\n\nint **myArray;\nint s1,s2,i;\n\nprintf("Input row size: ");\nscanf("%d",&s1);\nprintf("Input column size: ");\nscanf("%d",&s2);\n\nmyArray[0] = malloc(s1*s2*sizeof(int));\nif (myArray[0] != NULL ) {\n  for (i = 0;i<s1,i++) {\n         myArray[i] = (i * s2) + myArray[0];\n  }\n}\n\nmyArray can then be used as normal\n\nmyArray[2][4] = 20;
553452
Hyper-Threading.\nit's like a processor pretending to be 2.\ngenerally (depending on the application)\nit actually slows down performance\n\ni forgot the specifics on it, but it queus up instructions and splits them between two arithmetic logic units (ALUs)\nand other parts....\n\ndont take the second part of my answer word-for-word. i really don't remember the specifics