How many pointers do linear queues have?
Two: front and rear
What would this linear queue look like after the operation queue.dequeue()? (Front: Jack, Rear: Emily)
Front Rear – Emily
For what do the letters FIFO stand?
First in, first out
What data structure are queues based on?
Arrays
Which abstract data structure operates on a FILO basis?
Stacks
Define “Abstract data structure”
Data structures that don’t exist as data structures in their own right but make use of other data structures to form a new way of storing data
Define “array”
A finite, indexed set of related elements which have the same data type
What would this circular queue look like after the operation queue.enqueue(“Minta”)? (Front: Sarah, Rear: Angus)
Rear Front – Sarah Angus Minta
If two items in a priority queue have the same priority, what order are they removed in?
First in, first out
a = [4, 5], b = [5, 3]. What is a * b?
35 ((4×5) + (5×3))
What is the name of the procedure that adds an item to a stack?
Push
What is the name of the procedure that removes an item from a stack?
Pop
How many pointers do stacks have?
One: top
Which are best suited to dense graphs: adjacency matrices or adjacency lists?
Adjacency matrices
What is meant by a tree?
A connected, undirected graph with no cycles
If viewed as a list of numbers, which data structure can represent a vector?
A one-dimensional array
What is said to occur when two values produce the same hash?
A collision
What is a dictionary?
A collection of key-value pairs
Which type of data structures are fixed in size?
Static data structures
How is translation of vectors achieved?
Vector addition
Define a Tuple
An ordered, immutable sequence of elements used to store related data.
Cannot be changed after creation, can hold different data types
