Heap
-
Stack and Heap Memory RegionsModeling/Architecture 2020. 2. 26. 23:36
1. Overview 2. Stack 2.1 What is allocated in Stack Methods are called Arguments are passed Local variables are stored Stack + Instruction Pointer = State of each thread's execution 2.2 Example 2.3 Properties All variables belong to the thread executing on that stack Statistically allocated when the thread is created The stack's size is fixed, and relatively small which depends on the specific p..
-
Relationship of Thread, Process, OS, and MemoryModeling/Architecture 2020. 2. 4. 15:13
1. Overview When we turn on our computer a special program called the operating system is loaded from the disk into the memory. The operating system takes over and provides an abstraction for us the application developers and helps us interact with the hardware and the CPU so we can focus on developing our apps. All our applications such as the text editor a web browser or a music player reside ..
-
Binary HeapAlgoDS/DataStructure 2020. 1. 16. 12:46
1. Overview Basically, the idea is that the heap gets filled from the top to the bottom of the fill the top node first and then you build the left child and then you build the right child and then the next note if you want to add it to this heap you basically put it to the left and then to the right and then you put the love child and then the right child. So basically you build it on the way do..
-
Choosing the appropriate Data StructureAlgoDS/DataStructure 2019. 9. 4. 21:14
1. Overview Data structures are the way to store and retrieve data like accessing data using an index in an array or a named key to store and retrieve information from a dictionary. Choosing the appropriate data structure enhancing inputting, processing, maintaining, retrieving information. For performance, the developer should choose the right data structure. 2. Description Data Structure Descr..