Data Structures - marzoukali/cs-notes GitHub Wiki
Data Structures:
- A data structure is a particular way of organizing data in a computer so that it can be used effectively.
Data Structures Categories:
Primitive or Non-primitive:
1- Primitive Data Structures (Integer, float, char, pointer).
2- Non-primitive Data Structures (Array, List [Non-Linear: Tree, Graph & Linear: Stack, Queue], File).
Physical or Dynamic:
1- Physical Data Structures (Arrays, Matrices, Linked Lists).
2- Dynamic Data Structures ([Linear: Stack, Queue], [Non-linear: Tree, Graph],[Tabular: Hash Table]).
Memory Management Notes:
- Nice topic: https://medium.com/@shoheiyokoyama/understanding-memory-layout-4ef452c2e709
- In stack, the value types always declared inside a stack frame (Activation record) for the function itself.
- Nice to read: https://stackoverflow.com/questions/2565331/fields-of-class-are-they-stored-in-the-stack-or-heap
- Memory parts: Text (instruction), data (global vars), BSS (int i;), heap, stack.