SLR 14

Question 1

What is a data structure?

Answer 1

A way data can be stored in programming

Question 2

What is a record

Answer 2

A collection of related fields

Question 3

What number do indexes start at?

Answer 3

0

Question 4

What does it mean if a data structure is static?

Answer 4

The size of the structure size can’t change during runtime

Question 5

What does it mean if a data structure is dynamic?

Answer 5

The structure size can change during runtime

Question 6

What does it mean if a data structure is mutable?

Answer 6

Data inside can be changed during runtime

Question 7

What are the attributes of a list?

Answer 7

Dynamic
Mutable
Items are ordered
Can store more than one data type

Question 8

What are the attributes of an array?

Answer 8

Static
Mutable
Ordered
Items can change
Only one data type

Question 9

What are the attributes of a tuple?

Answer 9

Static
Immutable
Ordered
Items can’t be changed
More than 1 data type

Question 10

What is a linked list?

Answer 10

A data structure that provides a foundation for other structures, made up of nodes and pointers that are used to link nodes

Question 11

What is a graph?

Answer 11

A data structure that uses nodes and pointers similarly to a linked list, but also has vertices and edges

Question 12

What is a Pre-Order Traversal?

Answer 12

Travels a graph from the left of a node

Question 13

What is an in-order traversal?

Answer 13

Travels a graph from the bottom of a node

Question 14

What is a post-order traversal?

Answer 14

Travels a graph from the right side of each node

Question 15

What structure does a stack follow?

Answer 15

LIFO

Last in, first out

Question 16

What does a stack do before any changes are made?

Answer 16

Checks if the stack is full if it is pushed onto the stack

Checks if the stack is empty if an item is to be popped

Question 17

What are the attributes of a queue?

Answer 17

Linear
Items can be peeked at
Uses FIFO
Has a front and back pointer

Question 18

What is a queue overflow?

Answer 18

Adding to a full queue

Question 19

What is a queue underflow?

Answer 19

Taking from an empty queue

Question 20

What is a circular queue?

Answer 20

A queue which cycles back to the start to avoid affecting frame rates

Question 21

What are circular queues used for?

Answer 21

Process scheduling
Transferring data across processors l
Performing breadth-first searches

Question 22

What is a tree?

Answer 22

A fundamental data structure that uses nodes and pointers, while also starting with a root node and having leaf nodes which branch off them

Question 23

What is a binary tree?

Answer 23

A data structure similar to a tree but only has nodes with 0, 1 or 2 pointers connecting to a different node

Binary searches can be performed on these easily

Question 24

What is a hash table?

Answer 24

A function that finds an item in a list without comparing it to other items in the data set

It determines a hash value for a value to find an item

Question 25

How are collisions prevented in hash tables?

Answer 25

Every available space is checked until an empty one if found to store an item You can also store an item in the same space twice in a 2 dimensional hash table. This is called chaining.