Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Computer Science A-level > Fundamentals of data structures > Flashcards

Fundamentals of data structures Flashcards

1
Q

Data structures

A

A data structure is a format used to store, organise and manage data in a way that allows efficient access and modification for the needs of the program.

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

Arrays

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

Multi-dimensional arrays

A

An array where each data item is located using multiple indices.

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

Single-dimensional arrays

A

An array where each data item can be located using a single index.

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

Binary file

A

An organised collection of records where data is stored in binary.

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

Fields

A

A single item of data.

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

Records

A

A data structure that stores multiple fields, organised based on attributes, within a single line of a file.

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

Text file

A

An organised collection of records where data is stored in human-readable characters.

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

Dictionaries

A

A data structure consisting of a set of keys that are mapped to their corresponding values.

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

Dynamic structures

A

A data structure whose memory allocation size can change throughout the execution of the program.

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

Graphs

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

Hash tables

A

A data structure where a hashing algorithm creates a mapping between keys and values. 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
13
Q

Queues

A

A first-in-first-out (FIFO) dat 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
14
Q

Stacks

A

A last-in-first-out (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
15
Q

Static structures

A

A data structure that is allocated a fixed amount of memory space, which does not change throughout the execution of the program.

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

Trees

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.

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

Data structures

A

A data structure is a format used to store, organise and manage data in a way that allows efficient access and modification for the needs of the program.

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

Arrays

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

Multi-dimensional arrays

A

An array where each data item is located using multiple indices.

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

Single-dimensional arrays

A

An array where each data item can be located using a single index.

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

Binary file

A

An organised collection of records where data is stored in binary.

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

Fields

A

A single item of data.

24
Q

Records

A

A data structure that stores multiple fields, organised based on attributes, within a single line of a file.

25
Q

Text file

A

An organised collection of records where data is stored in human-readable characters.

26
Q

Dictionaries

A

A data structure consisting of a set of keys that are mapped to their corresponding values.

27
Q

Dynamic structures

A

A data structure whose memory allocation size can change throughout the execution of the program.

28
Q

Graphs

A

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

29
Q

Hash tables

A

A data structure where a hashing algorithm creates a mapping between keys and values. The data item can then be directly accessed by recalculation, without any search.

30
Q

Queues

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.

31
Q

Stacks

A

A last-in-first-out (LIFO) data structure. The last item added/pushed is the first to be removed/popped off.

32
Q

Static structures

A

A data structure that is allocated a fixed amount of memory space, which does not change throughout the. execution of the program.

33
Q

Trees

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.

34
Q

Vectors

A

A data structure representing a quantity with both magnitude and direction. It can be represented as a list, function or geometric point.

35
Q

Peek/Top

A

An operation that allows the user to view the top element of the stack without modifying it.

36
Q

Pop

A

An operation that removes the most recently added element that was not yet removed from the stack.

37
Q

Push

A

An operation that adds an element to the top of the stack.

38
Q

Adjacency list

A

A representation of a graph by storing a list of connected nodes to each node.

39
Q

Adjacency matrix

A

A matrix representation of a graph that stores the edges connecting all possible nodes.

40
Q

Directed graphs

A

A graph where the edges have a direction, usually represented by arrows.

41
Q

Edge/arc

A

A connection that represents a relationship between two nodes.

42
Q

Undirected graphs

A

A graph where the edges do not have a direction, meaning that each edge can be traversed in both directions.

43
Q

Vertex/Node

A

The representation of an object on a graph that is capable of being related to other such objects.

44
Q

Weighted graphs

A

A graph where each edge/arc has an associated value (known as its weight).

45
Q

Binary trees

A

A rooted tree in which each node has, at most, 2 children.

46
Q

Rooted trees

A

A tree in which one node has been designed as the root.

47
Q

Root node

A

The only node in a rooted tree without a parent.

48
Q

Trees

A

A connected, undirected graph with no cycles.

49
Q

Collisions

A

The phenomenon when two key values compute to the same hash.

50
Q

Hashing algorithms

A

An algorithm that calculates a value to determine the unique index where a data item is to be stored in a hash table.

51
Q

Rehashing

A

The process of rerunning the hashing algorithm in the event of a collision.

52
Q

Convex combination of two vectors

A

Any vector that can be expressed as a linear combination of the two vectors.

53
Q

Dot/scalar product of two vectors

A

The sum of the products of components with the same index of two vectors.

54
Q

Scalar-vector multiplication

A

An operation that multiples all the components of a vector by the same scalar quantity.

55
Q

Vector addition

A

An operation that adds two vectors by component-wise addition, resulting in another vector as the output.

Computer Science A-level (13 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions