The question is too broad to be answered in a short format for this site. I suggest you look at an operating systems textbook for a complete description.
There are two types of memory allocations. 1. Static memory allocation 2. Dynamic memory allocation
Writing a C program that uses dynamic memory allocation to sort names in ascending order is a typical computer science assignment. To write this program, you must be in UNIX.
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
Unix uses the same memory as any other operating system. This includes either physical or virtual memory.
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.
Static memory allocation occurs at compile time where as dynamic memory allocation occurs at run time.
Partitioned allocation is a fixed memory allocation technique which memory spaces are divided into smaller fixed partition, while Relocatable partitioning use variable and repartitioning technique