Crash Course Computer Science #14 - Data Structures

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)   are extremely versatile ​ (b)   structures, used all the time, and so there are many ​ (c)   that can handle them to do ​ (d)   things.

• Arrays
• data
• functions
• useful
• values
• algorithms

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