CS 171 Lecture Notes - Lecture 11: Memory Address
Document Summary
Is a way to store and organize data. Arrays(statics data structure) cannot grow its size(data in array can be edited) Lists(static arrays) can grow and double in size. Support efficient random access to any element in list. Can have infinite capacity (but more bounded to some maximum size) Like, when you put a piece of paper on top (. push) Methods operate on the top of the stack instead of the front and back of line. Is that if we want to get something out of them, we need. They can store a specific # of other objects in order. You cannot change it! (immutable) cannot remove, add, or replace objects not only can we not change what"s in them, but we also can"t change how many things they can store. And lists to know where within the data structure they are that is, their index. It has to be exactly the same length as the # of variables.