Fundamentals of Data Structures

Question 1

How many pointers do linear queues have?

Answer 1

Two: Front and rear

Question 2

What is FIFO?

Answer 2

First in, first out

Question 3

What does LIFO mean?

Answer 3

Last in, first out

Question 4

What data structures are queues based on?

Answer 4

Arrays

Question 5

Which abstract data structure uses FIFO?

Answer 5

Stacks

Question 6

Which abstract data structure uses LIFO?

Answer 6

Queues

Question 7

What is an abstract data structure?

Answer 7

Data structures that don’t exist as data structures in their own right, they make use of other data structures to form a new way of storing data

Question 9

What is an array?

Answer 9

A finite, indexed set of related elements of the same data type

Question 10

If two items in a priority queue have the same priority, what order are they removed in?

Answer 10

FIFO

Question 11

A = [4,5]
B = [5,3]
What is ab?

Answer 11

(4x5) + (5x3) = 35

Question 12

What procedure adds an item onto a stack?

Answer 12

Push

Question 13

What procedure removes an item from a stack?

Answer 13

Pop

Question 14

How many pointers do stacks have?

Answer 14

One: at the top

Question 15

What is best suited for dense graphs:
Adjacency matrices or adjacency lists?

Answer 15

Adjacency matrices

Question 16

What is meant by a tree?

Answer 16

A connected, undirected graph with NO cycles

Question 17

If viewed as a list of numbers, which data structure can represent a vector?

Answer 17

1D Array

Question 18

What occurs when two values produce the same hash?

Answer 18

Clustering (Preferred word by AQA)
OR
A collision

Question 19

What is a dictionary?

Answer 19

A collection of key-value pairs

Question 20

What type of data structures are fixed in size?

Answer 20

Static data structures

Question 21

How is the translation of vectors achieved?

Answer 21

Vector addition