Data Structure, Organised method of storing data so it can be accessed and manipulated, Static Data Structure, Data structure whose allocated size is fixed while the program executes, Dynamic Data Structure, Data structure capable of changing size during program execution, Array, Indexed collection of elements, normally of the same data type, stored under one identifier, One-dimensional Array, Array accessed using one index, Two-dimensional Array, Array organised into rows and columns and accessed using two indices, Record, Data structure grouping related fields that may have different data types, List, Ordered collection of data items, Tuple, Ordered collection whose values are normally fixed after creation, Linked List, Dynamic structure consisting of nodes connected using links or pointers, Node, Element of a linked structure containing data and one or more links, Pointer, Value identifying the location of another data item or node, Null Pointer, Pointer value indicating that no node is referenced, Stack, LIFO data structure where insertion and removal occur at the same end, LIFO, Last In, First Out; the most recently added item is removed first, Push, Add an item to the top of a stack, Pop, Remove and return the top item of a stack, Peek, Return the top stack item without removing it, Stack Overflow, Attempt to add an item when a fixed-size stack is full or available stack memory is exhausted, Stack Underflow, Attempt to remove an item from an empty stack, Queue, FIFO structure where items are added at the rear and removed from the front, FIFO, First In, First Out; the earliest item added is removed first, Enqueue, Add an item to the rear of a queue, Dequeue, Remove an item from the front of a queue, Circular Queue, Fixed-size queue where the end of the underlying array wraps around to the beginning, Graph, Non-linear structure consisting of vertices connected by edges, Vertex, Node within a graph, Edge, Connection between two vertices, Directed Graph, Graph in which edges have a specified direction, Undirected Graph, Graph in which edges can be traversed in either direction

A Level: Data Structures - Mr Gopal

by
Print
Embed

Leaderboard

Visual style

Options

AI Enhanced: This activity contains content generated by AI. Learn more.

Switch template

Continue editing: ?