Algorithm: A set of steps in a specific order that solve a problem.

Array: A group of items listed sequentially in computer memory.

Binary: A number system where the only digits are 0 and 1. It's what computers use to communicate.

Cache: A linear piece of memory in your computer used for instant access of information. It's also really small, so only certain things can be stored here.

Compiler: A program that converts your code in a high-level language down to code in a low-level language. It can see some—but not all—bugs.

Dictionary: A data structure of key-value pairs. The key tells you where the value is in memory.

Function: A separated piece of code that performs an action. When you write a function, you can access it anywhere in the code, giving your programs a non-linear structure.

Global Variable: A variable that can be called anywhere in a program.

Object: A way of organizing functions and data so that related processes can be grouped together. An object is usually compared to an object in the real world and is known for having states and behaviors.

High Level Language: A programming language that uses human language to give the computer instructions. High level languages always need to be broken down to low level languages before the computer can actually run them.

Interpreter: A program that converts a programming language directly into computer code, line-by-line.

Linked List: Items listed together through a linking system where each element has a pointer to the next element.

List: An umbrella metaphor for handling groups of objects in the computer memory. It can be implemented using an array or a linked list.

Local Variable: A variable that can only be called within a specific scope, whether it's in an object, function, or parameter.

Low Level Language: A language for giving the computer instructions. It's very close to binary, so most developers today try to avoid coding directly in it.

Pointer: A variable that holds the address to something in the computer's RAM. It basically "points" you to the object or function.

Queue: A type of list where the first element in is the first element out (FIFO).

RAM: Short for Random Access Memory, this part of your computer's memory is the cheapest memory to use just within the scope of the program. It's also harder to find things in here than it is in the cache.

Stack: A type of list where the last element in is the first element out (LIFO).