Karteikarten
4.2 Flashcards CS
Karten in diesem Stapel (15)
- 1Arrays- Allow multiple values of the same data type to be stored in a singular structure
- Arrays are indexed allowing a particular value to be referenced directly
(eg. animals[3]) - 2Files- Data can be stored persistently
- Data can be stored as text or binary data - 3Static Data structures- Stored in a fixed block of concurrent memory locations. Memory is allocated when structure is declared
- Cannot be changed once in use
(Cannot be resized)
- Quick to locate and edit existing data - 4Dynamic Data structures- Adjust their storage as necessary
-New locations can be added if needed for extra memory
- Easily resized
- Slower to locate and read data
- Data can be removed without re allocating data - 5Abstract Data structuresData structures defined by what they do rather than how they are implemented
(eg. Queue, Stack, List) - 6Queues- First in, First out
(FIFO)
- A priority queue allows the data to be removed before something in front of it in the queue even if it was in later
- A circular queue loops back round to the start once it is full (overwrites data) - 7Stacks- First in, Last out
(FILO) - 8GraphsVertex - a data item
Edge - a connection between the vertices
- 9Trees- Undirected graph that does not contain loops
- Used for graphics, classification etc.
- 10Dictionary- Stores data in a key-value pair
- 11Hash tables- Used for exceptionally quick searches
- Use a static data structure to store data at specific indexes
- A hash function is applied to data which creates a key, the data is then stored at this address. - 12Open Hashing- Values are stored in the next available space
- Results in more collisions
- If table isn't large enough you will need to rehash which takes time
- Table typically needs to be 30% larger than the number of items it will store - 13Closed Hashing-Data is stored in a dynamic data structure
No need for larger tables or rehashing due to this
- Can be slower to read - 14Rehashing- The process of creating a new, larger table and redoing all of the hashes in the old table to transfer them
- Takes ages - 15Vectors- In a vector all entries must be from the same field
- All vectors follow normal maths
Informationen
- Beschreibung
- Karteikarten am 4.2 Flashcards CS, erstellt von Big Will Mablonga am 20/05/2021.
- Erstellt von
- Big Will Mablonga
- Aufrufe
- 3
- Bewertung