what is a stack memory?
98341
When code is running, a 'stack' is a part of memory that is used to store data.  The data, as another pointed out, is stored in a fashion where the "last in is first out" or (adeptly named LIFO as an acronymn).\n\nYou can think of a 'stack' in a few different ways.  It can be imagined as a stack of the plates that they have at a buffet restaurant when you get your food.  The first plate put on the bottom of the stack is the last one that is taken off before they refill it.  Also, it's like a PEZ dispenser.  The first piece of candy put into the bottom of the dispenser is the last retrieved.\n\nAs you take a 'plate' or push a PEZ candy out of the dispenser's head, it is the same a "popping" the stack, as opposed to "pushing" data on the stack (which is how it gets there initially).\n\nThe stack memory itself is typically an area of memory that is addressable (able to be accessed) by the running process (or executable application).
898314
Here are some general data structures:\n\n- Set\n- List\n- Map\n- Tree\n- Table\n- Stack\n- Queue
271907
stack, queue done in JAVA are given here:\nif u want more, mail at ronysamuel@yahoo.com\nyahoo wont allow posting a big answer than this..\n\n----------------------STACK---------------------------\n\nimport java.io.*;\n\nclass StackFunc\n{\nfinal int MAX=5;\nprivate int a[]=new int[MAX];\nprivate int top;\n\nStackFunc()\n{\ntop=-1;\n}\n\nvoid push(int x)\n{\nif(stackFull())\nSystem.out.print("&#92;tStack Full.. Element not pushed..");\nelse\n{\na[++top]=x;\nSystem.out.print(&#92;tElement Pushed..");\n}\n}\n\nvoid disp()\n{\nif(stackEmpty())\nSystem.out.print("&#92;tStack Empty..");\nelse\nfor(int i=0;i<=top;i++)\nSystem.out.print(" "+a[i]);\n}\n\nvoid pop()\n{\nif(stackEmpty())\nSystem.out.print("&#92;tStack Empty..");\nelse\nSystem.out.print("&#92;tPoped element is "+a[top--]);\n}\n\nprivate boolean stackFull()\n{\nif(top==(MAX-1))\nreturn true;\nelse\nreturn false;\n}\n\nprivate boolean stackEmpty()\n{\nif(top==-1)\nreturn true;\nelse\nreturn false;\n}\n\nvoid credits()\n{\nSystem.out.print("&#92;n&#92;n&#92;n&#92;n&#92;t&#92;t&#92;t&#92;tDeveloped By&#92;n&#92;t&#92;t&#92;t&#92;t&#92;tRony Multimedia Pvt. Ltd..&#92;n&#92;n&#92;n");\n}\n}\n\nclass Stack\n{\npublic static void main(String args[])\n{\ntry\n{\nBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\nStackFunc s=new StackFunc();\nint choice;\n\ndo\n{\nSystem.out.print("&#92;n&#92;n&#92;t&#92;t&#92;tStack Operations");\nSystem.out.print("&#92;n&#92;t&#92;t&#92;t----------------");\n\nSystem.out.print("&#92;n&#92;n&#92;n&#92;t");\nSystem.out.print("&#92;n&#92;t1. Push..&#92;n&#92;t2. Pop..&#92;n&#92;t3. Display..&#92;n&#92;t4. Exit..");\nSystem.out.print("&#92;n&#92;n&#92;n&#92;tEnter your choice: ");\nString schoice=br.readLine();\nchoice=Integer.parseInt(schoice);\n\nswitch(choice)\n{\ncase 1: System.out.print("&#92;n&#92;n&#92;tEnter the element to be pushed: ");\nschoice=br.readLine();\ns.push(Integer.parseInt(schoice));\nbr.readLine();\nbreak;\n\ncase 2: s.pop();\nbr.readLine();\nbreak;\n\ncase 3:System.out.print("&#92;n&#92;n&#92;tElements in stack:");\ns.disp();\nbr.readLine();\nbreak;\n\ncase 4:s.credits();\nbr.readLine();\nbreak;\n\ndefault:System.out.print("&#92;n&#92;n&#92;tInvalid Entry..");\nbreak;\n}\n}\nwhile(choice!=4);\n}\ncatch(Exception e)\n{\nSystem.out.print("&#92;n&#92;n&#92;tError.."+e);\n}\n}\n}\n\n-------------------------SIMPLE QUEUE--------------------\n\nimport java.io.*;\n\nclass QueueFunc\n{\nfinal int MAX=5;\nprivate int a[]=new int[MAX];\nprivate int front;\nprivate int rear;\n\nQueueFunc()\n{\nfront=-1;\nrear=0;\n}\n\nvoid ins(int x)\n{\nif(queueFull())\nSystem.out.print("&#92;tQueue Full.. Element not inserted..");\nelse\n{\na[++front]=x;\nSystem.out.print("&#92;tElement Inserted..");\n}\n}\n\nvoid disp()\n{\nif(queueEmpty())\nSystem.out.print("&#92;n&#92;n&#92;tQueue Empty..");\nelse\nfor(int i=rear;i<=front;i++)\nSystem.out.print(" "+a[i]);\n}\n\nvoid del()\n{\nif(queueEmpty())\nSystem.out.print("&#92;tQueue Empty..");\nelse\nSystem.out.print("&#92;tDeleted element is :"+a[rear++]);\n}\n\nprivate boolean queueFull()\n{\nif(front==(MAX-1))\nreturn true;\nelse\nreturn false;\n}\n\nprivate boolean queueEmpty()\n{\nif(front<rear)\nreturn true;\nelse\nreturn false;\n}\n\nvoid credits()\n{\nSystem.out.print("&#92;n&#92;n&#92;n&#92;n&#92;t&#92;t&#92;t&#92;tDeveloped By&#92;n&#92;t&#92;t&#92;t&#92;t&#92;tRony Multimedia Pvt. Ltd..&#92;n&#92;n");\n}\n}\n\nclass SimpleQueue\n{\npublic static void main(String args[])\n{\ntry\n{\nBufferedReader br=new BufferedReader(new InputStreamReader(System.in));\nQueueFunc q=new QueueFunc();\nint choice;\n\ndo\n{\nSystem.out.print("&#92;n&#92;n&#92;t&#92;t&#92;tQueue Operations");\nSystem.out.print("&#92;n&#92;t&#92;t&#92;t----------------&qu
121612
RAM - Random Access Memory\n used to temporarily store programs to run them\nROM - Read Only Memory\n Used to store memory over long periods of time\nGUI - Graphic User Interface\n An interface that uses a visual display so that the user can interact with it\nCPU - Cntral Processing Unit\n The "brain" of the computer uses the information sent to it  to make everything happen.
1091843
Buffered Memory\nA buffer isolates the memory from the controller to minimize the load on the chip set. It is typically used when the system has a high density of memory and/or when a system has more than 3 memory module sockets.\n\nUnbuffered memory\nThis is where the chip set controller deals directly with the memory. There is nothing between the chip set and the memory chips on the module as they communicate.\n\nRegistered Memory\nRegisters delay memory information for one clock cycle to ensure all communication from the chipset is collected by the clock edge, providing a controlled delay on heavily loaded memories.\n\nIf I were you I would go to crucial.com and let them analyze your machine for the types of memory that are compatible with it, make recommendations, and then list options for you to choose from. \n\nThey are safe and reliable ...I have bought from them, as well as everyone I know...(even our local  Mom and Pop computer shops get their memory sticks from them.)
494250
You can add virtual memory
665797
memory of an instrument is a place where one can store its data.u can learn more if u study microprocessor.
83035
#define __TEST__\n\n#include <stdio.h>\n\n#ifdef __TEST__\n#include <conio.h>\n#include <stdlib.h>\n#endif\n#define STACKSIZE 64\n\n\nint stack[STACKSIZE];\nstatic int stack_ptr=0;\n\nvoid overflow_test( int pos )\n{\nif( pos >= STACKSIZE )\n{\nputs( "Stack overflow!&#92;n" );\nexit(1);\n}\n}\n\nvoid underflow_test( int pos )\n{\nif( pos < 0 )\n{\nputs( "Stack underflow!&#92;n" );\nexit(1);\n}\n}\n\nvoid push( int value )\n{\noverflow_test( stack_ptr+1 );\nstack[stack_ptr++] = value;\n}\n\nint pop( void )\n{\nunderflow_test( --stack_ptr );\nreturn stack[stack_ptr];\n}\n\n#ifdef __TEST__\n\nvoid wait4keypress( void )\n{\nwhile( !kbhit())\n;\n}\n\nint main( void )\n{\natexit(wait4keypress); \npush(1);\npush(2);\npush(3);\nprintf( "%d&#92;n", pop());\nprintf( "%d&#92;n", pop());\nprintf( "%d&#92;n", pop());\n/* must cause stack underflow */\nprintf( "%d&#92;n", pop());\nreturn 0;\n}\n\n#endif  /* __TEST__ */
155718
< RAM\n(Random Access Memory) A group of memory chips, typically of the dynamic RAM (DRAM) type, which function as the computer's primary workspace. When personal computers first came on the market in the late 1970s, 64KB (64 kilobytes) of RAM was the upper limit. Today, 64MB (64 megabytes) of SDRAM is entry level for a desktop computer, a thousand times as much (see SDRAM).\n\nThe "random" in RAM means that the contents of each byte of storage in the chip can be directly accessed without regard to the bytes before or after it. This is also true of other types of memory chips, including ROMs and PROMs. However, unlike ROMs and PROMs, RAM chips require power to maintain their content, which is why you must save your data onto disk before you turn the computer off. To learn about the types of RAM chips and how to upgrade your memory, see memory module. To learn how memory is used to process data, see computer or memory. See also dynamic RAM and static RAM.
520415
Learn assembler\n\nuse softice or linice to read memory changes\n\n\nsee what changes what and where then make a proggy to manipulate values in the memory.
30207
Just to elaborate on the other answers. VRAM is memory which is used strictly by the video card (or chipset when using integrated graphics, IE; built into a motherboard). Shared memory uses your systems memory (RAM). The amount of shared memory used is usually set through the system BIOS. The more system ram set aside for your graphics card the less system memory you actually have available. A good rule of thumb is to use about 1/3 of system memory for your video card. In the BIOS this setting may be referred to as AGP aperature.
1016162
Where are you seeing this?  In task manager?  IT is probably a backdoor program or spy ware using up processing time within the memory.
485162
Ummm, A COMPLETELY empty memory?!... Well, there's no completely memory I think! Memory we allocate, is always full of garbage. BUT, if u use assembly, u can 1st give the value of 0 to the bits of that part of memory u wanna allocate, and then try to do what u want!...
220075
DDR(Double Data Rate)ram. or sometimes called PC 2100/2700/3200\nBoards a couple years old used SDRAM or Rambus Ram
1149857
Your instinct is right:  it has both dedicated memory and shared memory (ATI calls it "HyperMemory").  You can have up to 256M of dedicated memory, and up to 128M more of shared.  It's actually a nice feature, since you can tune how much shared memory to use depending on what you're doing (and if you hate shared memory on principle you can just leave it off).\n\nThe second link below is about the 200M for Intel-based systems.  It looks like that version doesn't have shared memory, just dedicated.
1172785
Memory Leakage is when a program does not fully release all the RAM it used upon exit. Ram booster programs say they can help but most are junk. Better to optimize your system startup and reboot occasionally.
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.