Karteikarten
4.2
Karten in diesem Stapel (11)
- 1Data structureA structure where data is stored and organsised
- 2ArrayAllow multiple values of the same data type to be stored. N dimensional arrays. Arrays are indexed allowing a specific value to be referenced
- 3Abstract data structureA data structure that is defined by what they do rather than how they are implemented
- 4Queuean ads that has the following commands: add an item to the back of the queue, remove an item from the front of a queue, and check for a full and empty queue. FIFO. Circular queues means that the data added to the back starts overwriting data at the front of the queue. Priority queue is when each value is given a priority so data added at the back can still be removed before data 'before' it. Keyboard presses, print jobs.
- 5Stacksan abs that has the following commands: push to add an item to the stack, pop to remove an item, peek/top to view an item in the stack without removal, check for a full/empty stack. FILO. Storing stack frames from return calls from functions. implementation of rpn.
- 6GraphsAn ads used to represent more complex relationships
- 7TreeA connected, undirected graph that contains no loops
-Graphics
-Classifications
-Parsing HTML
-Binary search trees
-File systems - 8Rooted treeone vertex is designated as the root
- 9Binary treeA routed tree where each node has at most 2 daughter nodes.
- 10Advantages/disadvantages of dynamic and static data structures.A static data structure's size is declared at run time, whereas a dynamic data structure's can change whilst the program is being run, to fit the data it holds. Static can waste storage by taking up more space than the data in them requires. Static data structures uses a block of consecutive memory locations, whereas dynamic uses any memory locations.
- 11Implementation of a stack - example rpnPush values into a stack, unless they are an operator. If an operator is encountered, pop the top 2 values from the stack , apply the operator and then push the result back onto the stack.
Informationen
- Beschreibung
- Karteikarten am 4.2, erstellt von James John am 16/04/2022.
- Erstellt von
- James John
- Aufrufe
- 0
- Bewertung