Data Structures Flashcards

(15 cards)

1
Q

arrays definition

A

a data structure for storing a finite, ordered set of data of the same data type within a single identifier

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

binary search tree definition

A

a tree where each node cannot have more than 2 children

the right node and its descendants always have a greater value than the root node (first data item)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

breadth first traversal definition

A

a method of traversing an entire graph by visiting all the neighbours of the first node before repeating the same with each neighbour in the order they were visited

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

depth first traversal definition

A

a method of traversing an entire graph by travelling as far as far as possible along one route before backtracking and trying alternative unexplored routes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

directed graphs definition

A

a graph where the order of the vertices are paired in an edge matter

the edges are one way

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

graphs definition

A

a data structure consisting of a set of vertices/nodes connected by a set of edges/arcs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

hash table definition

A

a data structure where a hashing algorithm calculates a value to determine where a data item is to be stored

the data item can then be directly accessed by recalculation, without any search

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

linked lists definition

A

a data structure that stores an ordered sequence of data where each item is stored with a pointer to the next item

the items are not stored contiguously (in the same order) in memory

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

lists definition

A

a data structure that stores a sequence of data values, each with a unique index

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

queues definition

A

a first-in-first-out (FIFO) data structure

the first item added/pushed on to the queue is the first to be removed/popped off

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

records definition

A

a data structure that stores data in elements called fields, organised based on attributes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

stacks definition

A

a last-in-first-our (LIFO) data structure

the last item added/pushed is the first to be removed/popped off

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

trees definition

A

a data structure that uses a set of linked nodes to form a hierarchical structure starting at a root node

each node is a child/sub-node of a parent node

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

tuples definition

A

a data structure for storing an immutable (cannot be modified once created), ordered set of data, which can be different data types, within a single identifier

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

undirected graphs definition

A

a graph where the order of the vertices paired in an edge does not matter

the edges are bidirectional

How well did you know this?
1
Not at all
2
3
4
5
Perfectly