Definitions of Data Structures Flashcards

1
Q

What is an array?

A

A data structure for sorting an 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

What is a record?

A

A data structure that stores data in elements called fields, organized on attributes.

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

What is a binary tree?

A

A tree where each node can only have 2 children . The right node and its children always have a greater value than the root node

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

What is a tuple?

A

A data structure for storing an immutable set of data that can be of different data types within a single identifier

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

What is the root node?

A

The first data item

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

What does immutable mean?

A

Something that cannot be changed once created

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

What is the breadth first traversal?

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
8
Q

What is depth first traversal?

A

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

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

What is a directed graph?

A

A graph where the order of vertices 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
10
Q

What is a graph?

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
11
Q

What is a hash table?

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 be directly accessed by recalculation, without any search

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

What is a list?

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
13
Q

What is a linked list?

A

A data structure where each node consists of data and pointer. The pointer gives the location of the next node

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

What is a queue?

A

A first in first out (FIFO) data structure. The first 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
15
Q

What is a stack?

A

A last in first out data structure. (LIFO). 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
16
Q

What is a tree?

A

A data structure that uses a set of linked nodes to form a hierarchical structure starting at the root node. Each node is a child/sub node of a parent node

17
Q

What is an undirected graph?

A

A graph where the order of get vertices paired in an edge does not matter. The edges are bidirectional