Stack
-
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 ..
-
StackAlgoDS/DataStructure 2020. 1. 16. 23:04
1. Overview Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). 2. Description 2.1 Operations 2.1.1 Push Adds an item in the stack. If the stack is full, then it is said to be an Overflow condition. 2.1.2 Pop Removes an item from the stack. The items are popped in the reversed..
-
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..