Karteikarten
Data Types and Abstract Structures | Data Structures - OCR Computer Science A Level
Karten in diesem Stapel (6)
- 1What is an Abstract Data Type?> Created by the programmer
> Not defined within the programming language
> Easy to represent in graphical forms
> Programming languages require other data types to represent them - 2What are some Examples of Abstract Data Types?> Queues
> Stacks
> Trees
> Graphs - 3What is a Static Data Structure?A data structure with a fixed size: it cannot increase in size, or decrease and free up memory (while the program is running): an array.
- 4What is a Dynamic Data Structure?> Collection of data in memory that has the ability to grow or shrink in size
> Uses a heap - a portion of memory where space is automatically allocated or de-allocated when required
> Supported in Python, Java, and C (amongst others) - 5What are the Advantages and Disadvantages of a Static Data Structure?> Suitable for storing a fixed number of items without exceeding memory
> The size has to be decided in advance, meaning that no more can be added if the number of items fills up, regardless of how much free space there is in memory - 6What are the Advantages and Disadvantages of a Dynamic Data Structure?> Useful for implementing data structures where the maximum size of the data structure is not known in advance
> Methods or functions may already be written in advance in the programming language (e.g.: lists in Python)
> The data structure can potentially cause an overflow and crash the program if it exceeds the maximum memory limit
Informationen
- Beschreibung
- A level Computer Science (Data Structures) Karteikarten am Data Types and Abstract Structures | Data Structures - OCR Computer Science A Level, erstellt von Malachy Moran-Tun am 08/10/2021.
- Erstellt von
- Malachy Moran-Tun
- Aufrufe
- 15
- Verlauf
-
- Erstellt von Malachy Moran-Tun · 6 Okt 2021
- Kopiert von Malachy Moran-Tun · 8 Okt 2021
- Bewertung