WorksheetsCrash Course Computer Science #14 - Data Structures
Total questions: 15
Worksheet time: 12mins
What did we NOT talk about last episode?
sorting lists
finding the shortest path on a graph
how data from algorithms is stored in memory
an example of what an algorithm looks like
What is an array?
a series of values stored in memory
really big graphs
a list of different functions in RAM
an encoded function within another function
Almost all programming languages start arrays at index _.
Enter a number.
(a)
(a) are extremely versatile (b) structures, used all the time, and so there are many (c) that can handle them to do (d) things.
What is a string?
an array of characters
groups of people
a collection of wires
individual microchips, laid side by side
The binary value 0 at the end of a string in RAM that denotes the end is called a...
null character
final character
absolute character
finite character
You can think of a matrix as
an array of arrays
a collection of arrays
a smattering of arrays
arrays in sequence
Groups of variables can be bundled together into a
collection
team
struct
squad
A linked list is...
a flexible data structure that can store many nodes
a node that circles back to another node
an array of structs that can calculate functions
a matrix of structs that can store many arrays
Two examples of more complex data structures that can be built on top of linked lists are
queues
alogrithms
stacks
bits
The post office example shows...
stacks
arrays
queues
stacks
Match the following
queues - (a)
stacks - (b)
The top of the tree node is a (a) , and any nodes that hang from other nodes are called (b) nodes. The top of children nodes are (c) nodes. If there are no children nodes, it's called a (d) node.
A important property of trees in that
there's a one-way path
they are alive
they have leaves
they convert something into something else
Most programming languages come with ____ packed full of ready-made data structures.
algorithms
arrays
libraries
storage
