COMPTNG 10C Lecture Notes - Lecture 5: Object Copying, Call Stack, Resource Acquisition Is Initialization
8 Oct 2016
School
Department
Course
Professor
Document Summary
Stack on top and the book under it cannot be accessed. Heap have to keep track of where things are placed. Disadvantage: other programs can mess with your data. Memory management creates memory in heap, pointer is in stack. releases memory, but does not affect the pointer. string and vector classes have new and delete built in to them. Memory leaks happen when memory is not manually de-allocated after it is allocated. Code each function definition has a set of instructions that does not change during program. Values are modifiable but do not belong to any local scope. Run-time stack calls f(), run-time stack stacks from bottom parameters, return address, and then local variables of f(). memory that is stacked as the program runs. 04. 10 section happens when stack runs out of memory; program force exits. The modern machine has multiple cores, cores = cpus. Hyper threading allows double the core amount of processing.
