CS 106A Lecture Notes - Lecture 13: Zetta-, Memory Address, Memory Management
20 Aug 2016
School
Department
Course
Professor
Document Summary
Memory: bit, bit = single binary digit: 0 or 1, byte = 8 bits, word = 4 bytes (java) = 32 bits, 1024 multipliers d. i. Kilo (k) = 210 = 1024 bytes d. ii. Yotta: hexadecimal, uses base of 16, 2b = 32 + 11 = 43. C = 12 c. if there"s more places like _2b then the _ is that value times 162: memory, stack and heap grow as, stack b. i. parameters and local variables b. ii. Whenever you call you method; involved are created on the stack b. iii. When method is done, then all that memory is reclaimed b. v. as you add, going upward, increasing address number: heap c. i. Reclaimed when object is done being used c. ii. 1. c. ii. 2. If you return object, object is still being used. As you add, going downward, increasing address number: stack builds up while heap builds down (in memory address. If they collide, not enough memory d. i. d. ii.
