WorksheetsData Structures Key Terms
Total questions: 25
Worksheet time: 14mins
a LIFO structure where the last item of data added is the first to leave.
Stack
LIFO
Pointer
Stack Frame
Last in first out refers to a data structure such as a stack where the last item of data entered is the first item of data to leave.
Stack
LIFO
Pointer
Stack Frame
a data item that identifies a particular element in a data structure normally the front or rear.
Stack
LIFO
Pointer
Stack Frame
a collection of data about a subroutine call.
Stack
LIFO
Pointer
Stack Frame
Call Stack
a special type of stack used to store info about active subroutines and functions within a program.
a signal sent by a device or program to the processor requesting its attention.
the process of putting one statement inside another statement.
the process of a subroutine calling itself.
Interrupt
a special type of stack used to store info about active subroutines and functions within a program.
a signal sent by a device or program to the processor requesting its attention.
the process of putting one statement inside another statement.
the process of a subroutine calling itself.
Recursion
a special type of stack used to store info about active subroutines and functions within a program.
a signal sent by a device or program to the processor requesting its attention.
the process of putting one statement inside another statement.
the process of a subroutine calling itself.
Nesting
a special type of stack used to store info about active subroutines and functions within a program.
a signal sent by a device or program to the processor requesting its attention.
the process of putting one statement inside another statement.
the process of a subroutine calling itself.
A FIFO structure organised as a line of data.
Linear Queue
Circular Queue
Priority Queue
A FIFO structure implemented as a ring where the front and rear pointers can wrap around the end of the start of the array.
Linear Queue
Circular Queue
Priority Queue
A FIFO structure where some data may leave out of sequence where it has a higher priority than other data items.
Linear Queue
Circular Queue
Priority Queue
Graph
A mathematical structure that models the relationship between pairs of objects.
The underlying mathematical principles behind the use of graphs.
An object in a graph. Also know as a node (vertices is the plural).
A join (relationship) between two nodes - sometimes called an edge.
Graph Theory
A mathematical structure that models the relationship between pairs of objects.
The underlying mathematical principles behind the use of graphs.
An object in a graph. Also know as a node (vertices is the plural).
A join (relationship) between two nodes - sometimes called an edge.
Vertex/Vertices
A mathematical structure that models the relationship between pairs of objects.
The underlying mathematical principles behind the use of graphs.
An object in a graph. Also know as a node (vertices is the plural).
A join (relationship) between two nodes - sometimes called an edge.
Arc
A mathematical structure that models the relationship between pairs of objects.
The underlying mathematical principles behind the use of graphs.
An object in a graph. Also know as a node (vertices is the plural).
A join (relationship) between two nodes - sometimes called an edge.
Weighted graph
a graph that has a data value labelled on each edge.
The underlying mathematical principles behind the use of graphs.
An object in a graph. Also know as a node (vertices is the plural).
A join (relationship) between two nodes - sometimes called an edge.
A graph where the relationship between vertices is two way.
Undirected Graph
Directed Graph
Adjacency List
Adjacency Matrix
A graph where the relationship between vertices is one way.
Undirected Graph
Directed Graph
Adjacency List
Adjacency Matrix
a data structure that stores a list of nodes with their adjacent nodes.
Undirected Graph
Directed Graph
Adjacency List
Adjacency Matrix
a data structure set up as a two dimensional array or grid that shows where there is an edge between each pair of nodes.
Undirected Graph
Directed Graph
Adjacency List
Adjacency Matrix
Root
data structure similar to a graph, with no loops.
an object in a graph also known as a vertex
a join of relationship between nodes - also know as an arc
the starting node in a rooted tree structure from which all other nodes branch off./
Tree
data structure similar to a graph, with no loops.
an object in a graph also known as a vertex
a join of relationship between nodes - also know as an arc
the starting node in a rooted tree structure from which all other nodes branch off./
Node
data structure similar to a graph, with no loops.
an object in a graph also known as a vertex
a join of relationship between nodes - also know as an arc
the starting node in a rooted tree structure from which all other nodes branch off./
Root
data structure similar to a graph, with no loops.
an object in a graph also known as a vertex
a join of relationship between nodes - also know as an arc
the starting node in a rooted tree structure from which all other nodes branch off./
Binary TREE
data structure similar to a graph, with no loops.
an object in a graph also known as a vertex
a join of relationship between nodes - also know as an arc
a tree where each node can only have 2 child nodes attached to it
