Skip to main content

Introduction of Free Pool Data Structure in C Language

Free Pool

         Dynamically the memory is allocated to the requesting data structure from an area of the main memory called Free Pool. If no cell is free, then no memory is allocated, results in memory allocation error. The dynamically created memory, when it is deleted, is periodically collected by the Operating System and added to the Free Pool. This process of adding deleted, unwanted, memory is called as “Garbage Collection”.

        The free pool in the main memory is treated as an empty linked list and it is called as AVAIL linked list. AVAIL is an external pointer similar to ROOT of a linked list, contains the address of the first free node of the AVAIL linked list. AVAIL address is allocated to NEW node when a new node is created means when memory for a new node is allocated i.e. when memory is requested. After the allocation of AVAIL address to NEW node, AVAIL is updated to point to the next free node of the AVAIL linked list. It can be shown by means of the below algorithmic notation’s statements.
                                       NEW <--- AVAIL
                                      AVAIL<--- AVAIL---> LINK
                AVAIL--->  LINK mean the LINK part of AVAIL node(---> is an arrow operator to access field of a struct pointer). INFO, the information part of node to be created or added to the list is copied to the INFO part of NEW node, NEW     INFO. Then the NEW node can be used for the purpose.


If a node is to be allocated with a new address, NEW is allocated with the address 402 pointed by AVAIL. So NEW points to 402 and INFO part of it is copied with the information to be stored in the node. The LINK part of it is initially copied with 0, an invalid address. In the mean time the AVAIL is updated to point to the next free node i.e. AVAIL  is incremented to point to the location (address)505.


Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …