check this out..should be enough!! http://crasseux.com/books/ctutorial/union.html#union
Paging is a memory management scheme that permits the physical- address space of process to be noncontiguous.
It supports multiprogramming since multiple processes can be stored inside the main memory.
There are two types of memory allocations. 1. Static memory allocation 2. Dynamic memory allocation
Paging is a memory management scheme, in which data is fetched from the disk to memory in the form of equal size blocks called pages.paging is a method for allowing the non-contiguous allocation of memory space to processes when nedded.
Single user contiguous scheme is a memory allocation technique where a single block of contiguous memory is allocated to a process. This means that the entire memory space needed by a process must be available in a single block without any breaks or fragmentation. It simplifies memory management but can lead to wastage of memory due to fragmentation.
Contiguous memory allocation in C programming refers to the assigning of consecutive memory blocks to a process. Contiguous memory allocation is one of the oldest and most popular memory allocation schemes in programming.
Static Memory Allocation: Allocating the total memory requirements that a data structure might need all at once without regard for the actual amount needed at execution time. Dynamic Memory Allocation: The opposite strategy of static memory allocation - Dynamic Memory Allocation, involves allocating memory as-needed.
Linked lists use dynamic memory allocation (also called "heap memory allocation", as the linked list is stored in heap memory).
Memory allocation: When a program asks for memory and gets it. Contiguous allocation: When the memory is in one big block, for example memory addresses 1000-2000, as opposed to "fragmented allocation" where the memory comes as several smaller blocks in different places, for example memory addresses 1000-1050, 2050-2125, ...
Memory allocation is not necessary to display a matrix.
= for memory allocation schemes? = http://wiki.answers.com/Q/FAQ/2096= for memory allocation schemes? = http://wiki.answers.com/Q/FAQ/2096
In a contiguous memory allocation there is no overhead during execution of a program. In a non contiguous memory allocation address translation is performed during execution.