Memory Management

-


Total memory allocation of a Program are divided into 4 parts
  1.  Instruction
  2. Data
  3. Stack
  4.  Heap
what they store ?
  • Instruction  --- store all lines and instruction in program .
  • Data --   global and static variable.
  • Stack--  function , local , variable, variable in  function ,recursion time memory
                          and loop (any memory that are needed for operation)
                          time and various memory that are required at time while performing job .
  • Heap -- dynamic created memory.(by malloc , new ) 
  1. Instruction  and Data

    both memory size are fix at the time of program start .
2. Stack and Heap
 
  memory consumption change throughout the program.

Comments

Post a Comment

Popular posts from this blog

Difficulty in Learning Programming Languages? Follow these guided steps

-
Image
img .. Learning a new Programming Language is always very hard but it is not as difficult as learners make it. While it always involves some kind of frustration to learn a  new Programming Language in the starting but as time passes by and you gain mastery over a language things become very easy and interesting for you. Many of the learners quits their first programming language after their some unsuccessful attempts and make a diversion in their career. This is for the reason I decided to write an article for anyone who is on the difficult terrain of learning a programming language and want some guide to help him out in tackling the challenges faced in Programming. Well, I have come her for you with some of the most useful and guided steps that you should and must follow while learning any Programming Languages. Whether you are learning C,Java, Python, Scala or any Programming Language, keep these guided steps with you and elevate to the greater heights of programming....
Read more

WHAT IS INSERTION SORT ?

-
Image
INSERTION SORT  I nsertion sort is a very simple sorting algorithm in which the sorted array (or list) is built one element at a time. We all are familiar with this technique of sorting, as we usually use it for ordering a deck of cards while playing bridge. The main idea behind insertion sort is that it inserts each item into its proper place in the final list. To save memory, most implementations of the insertion sort algorithm work by moving the current data element past the already sorted values and repeatedly interchanging it with the preceding value until it is in its correct place. Insertion sort is less efficient as compared to other more advanced algorithms such as quick sort, heap sort, and merge so Technique    Insertion sort works as follows:  The array of values to be sorted is divided into two sets. One that stores sorted values and another that contains unsorted values.   The sorting algorithm will proceed unti...
Read more

Why coding and programming are in trend and what's the difference?

-
Image
Because of An Hour of Code (often giving people the strange delusion that he or she can earn a higher wage by throwing symbols at a screen without understanding what, exactly they're doing. It will benefit you in a positive sense (not just a new fast food monkey throwing symbols at a screen), if you can dedicate more than an hour of code a day or week, and it interests you, and you keep at it and keep learning more (evolve with technology, and understand how to do programming for different technologies, how they interact, and how to solve problems in an efficient manner). What's the best thing about coding/programming? Programming is like writing a story. Except for the characters and plotlines, you write to exist in the truest sense. An app or data analysis tool doesn't have to leap off a page or be confined to the imagination, or the whiteboard. The code can control and do real things. Code is magic and fantastic. To an outsider (or someone programming b...
Read more