Chapter 14
Dynamic Memory Allocation
CHAPTER OUTLINE
14.1 DYNAMIC MEMORY ALLOCATION
For execution of a program, it is essential to bring the program into the main memory. When a program does not fit into the main memory, parts of it are brought into the main memory one by one and the full program is executed eventually. Of course, parts of the program that are not currently in main memory are resident at secondary memory locations, such as floppy, hard disk, or any other magnetic disk. When a new segment of a program is to be moved into a full main memory, it must replace another segment already resident in the main memory. The programmer should not ...
Get Computer Programming and IT now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
