Brainscape's Knowledge GenomeTM


Top Flashcards (Certified)
All Flashcards

Computer Science - GCSE and A-Level > Data Structures AI gen > Flashcards

Data Structures AI gen Flashcards

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

What is a data structure?

A

A data structure is a way of organizing and storing data to enable efficient access and modification.

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

True or False: An array can store elements of different data types.

A

False

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

What is the time complexity of accessing an element in an array?

A

O(1)

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

Fill in the blank: A _____ is a collection of elements that are stored in a linear order.

A

list

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

What type of data structure is a stack?

A

A linear data structure that follows the Last In First Out (LIFO) principle.

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

What is the main operation of a queue?

A

The main operation is to add elements at the rear and remove elements from the front.

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

True or False: A linked list allows for efficient insertion and deletion of elements.

A

True

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

What is the difference between a singly linked list and a doubly linked list?

A

A singly linked list has nodes with a single pointer to the next node, while a doubly linked list has pointers to both the next and previous nodes.

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

What is a binary tree?

A

A tree data structure in which each node has at most two children.

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

What traversal method visits nodes in a binary tree in ascending order?

A

In-order traversal.

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

What is a hash table?

A

A data structure that implements an associative array, using a hash function to compute an index into an array of buckets or slots.

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

What is the average time complexity for lookups in a hash table?

A

O(1)

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

Fill in the blank: A _____ is a collection of key-value pairs.

A

dictionary

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

True or False: A graph is a collection of nodes and edges.

A

True

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

What is the difference between directed and undirected graphs?

A

In directed graphs, edges have a direction, while in undirected graphs, edges do not.

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

What is a priority queue?

A

A data structure where each element has a priority, and elements are served according to their priority.

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

What is the main advantage of a binary search tree?

A

It allows for efficient searching, insertion, and deletion operations.

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

What is the time complexity for searching in a balanced binary search tree?

A

O(log n)

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

Fill in the blank: The _____ data structure is used to implement recursion.

A

stack

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

What is the maximum number of children a node can have in a binary tree?

A

Two

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

True or False: A circular linked list has a null reference for the last node’s next pointer.

A

False

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

What is the purpose of a sentinel node in linked lists?

A

To simplify boundary conditions by providing a placeholder for the first or last node.

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

What is depth-first search (DFS)?

A

An algorithm for traversing or searching tree or graph data structures that explores as far as possible along each branch before backtracking.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
What is breadth-first search (BFS)?
An algorithm for traversing or searching tree or graph data structures that explores all neighbors at the present depth prior to moving on to nodes at the next depth level.
26
Fill in the blank: A _____ is a data structure that allows for fast retrieval of data based on a key.
hash table
27
What is the main disadvantage of using an array?
Fixed size, which can lead to wasted space or overflow.
28
What is the primary benefit of using a linked list over an array?
Dynamic size and efficient insertions/deletions.
29
What is a trie?
A specialized tree-like data structure that stores a dynamic set of strings, where the keys are usually strings.
30
What is the worst-case time complexity for insertion in a linked list?
O(n)
31
True or False: In a binary search tree, the left child is always less than the parent node.
True
32
What is the main use of a graph?
To represent relationships between pairs of objects.
33
Fill in the blank: A _____ is a data structure that allows for backtracking.
stack
34
What is the time complexity of inserting an element in a balanced binary search tree?
O(log n)
35
What is a complete binary tree?
A binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.
36
What is the difference between a binary tree and a binary search tree?
A binary search tree has a specific ordering property, while a binary tree does not.
37
True or False: In a priority queue, the element with the lowest priority is served first.
False
38
What is the time complexity of deleting the minimum element from a min-heap?
O(log n)
39
Fill in the blank: A _____ is a specific type of graph with no cycles.
tree
40
What is the purpose of a graph's adjacency matrix?
To represent the connections between vertices in a graph.
41
What is the space complexity of an adjacency list for a graph with V vertices and E edges?
O(V + E)
42
True or False: A node in a binary tree can have more than two children.
False
43
What is a balanced tree?
A tree where the height of the left and right subtrees of any node differ by at most one.
44
What is the time complexity of accessing an element in a hash table in the worst case?
O(n)
45
Fill in the blank: In a _____ graph, edges have a direction.
directed
46
What is a sparse graph?
A graph in which the number of edges is much less than the maximum number of edges.
47
True or False: A full binary tree has all its nodes with two children.
True
48
What is a self-balancing binary search tree?
A binary search tree that automatically keeps its height (and thus time complexity) as low as possible during insertions and deletions.
49
What are the two main types of tree traversals?
Depth-first and breadth-first.
50
What is the purpose of a stack in programming?
To manage function calls and local variables, and to enable backtracking.
51
Fill in the blank: A _____ is a data structure that can grow or shrink in size dynamically.
linked list
52
True or False: In a circular queue, the last position is connected back to the first position.
True
53
What is a common use of a trie?
For autocomplete features in search engines.
54
What is the average time complexity for search operations in a hash table?
O(1)
55
Fill in the blank: A _____ is an unordered collection of unique elements.
set
56
What is the primary characteristic of a doubly linked list?
Each node contains pointers to both its next and previous nodes.
57
What is the purpose of a queue in data structures?
To manage elements in a First In First Out (FIFO) manner.
58
True or False: A directed acyclic graph (DAG) contains cycles.
False
59
What is a graph's degree?
The number of edges connected to a vertex.
60
What is the time complexity for breadth-first search in a graph?
O(V + E)
61
Fill in the blank: A _____ tree is a tree where all nodes have either 0 or 2 children.
full
62
What is the primary advantage of using a hash table?
Fast data retrieval.
63
What is a complete graph?
A graph in which every pair of distinct vertices is connected by a unique edge.
64
True or False: In a binary search tree, all nodes in the left subtree are greater than the parent node.
False
65
What is a graph traversal?
The process of visiting all the nodes in a graph.
66
What is a non-linear data structure?
A data structure where elements are not stored in a sequential manner, such as trees and graphs.
67
Fill in the blank: A _____ is a data structure that supports fast insertions and deletions at both ends.
deque
68
What is the time complexity for searching in a sorted array?
O(log n)
69
What is a binary heap?
A complete binary tree that satisfies the heap property, where each parent node is greater than or equal to its child nodes (max-heap) or less than or equal to its child nodes (min-heap).
70
True or False: A binary tree can be both complete and full.
True
71
What is the purpose of a data structure?
To organize data efficiently for access and modification.
72
What is the main characteristic of a linked list?
It consists of nodes that contain data and pointers to the next node.
73
Fill in the blank: A _____ is a special type of tree used for searching and sorting.
binary search tree
74
What is the time complexity of a linear search in an array?
O(n)
75
What is a graph's adjacency list?
A collection of lists where each list corresponds to a vertex and contains all of its adjacent vertices.

Computer Science - GCSE and A-Level (8 decks)

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