Translates and executes program code line by line into machine code.
Translates, or “compiles” the entire code into machine code and then runs the program, or sets aside to run later.
A programming language is any set of rules that converts strings, or graphical program elements in the case of visual programming languages, to various kinds of machine code output.
a computer programming language consisting of binary instructions
A language where variable types are determined at runtime, not in advance.
A language where variable types are explicitly declared and checked at compile time.
The process of verifying and enforcing the constraints of types in a programming language.
The period when a program is running, after it has been compiled or interpreted.
The binary number system is the Base 2 Number System. It is a number system that only uses 2 digits (0 and 1).
The decimal number system is the Base 10 number system. It is a number system that only uses 10 digits (0 through 9).
The octal number system is the Base 8 number system. It is a number system that only uses 8 digits (0 through 7).
The hexadecimal number system is the Base 16 number system. It is a number system that only uses 16 digits (0 1 2 3 4 5 6 7 8 9 A B C D E F)
Bit means "binary digit". A bit is a single digit in a binary number. A bit can either be 0 or 1.
Scientific notation is a way of writing numbers that are very large or very small in a compact form, making them easier to work with.
A for loop lets us repeat code a **fixed number of times.**
Lets us repeat code as long as something is true.
Exits the current loop and resumes execution at the next statement.
At a high level, recursion is when a function (or method) calls itself.
The base case is the simplest form of the recursive problem. The base case can be immediately solved without breaking the problem down any further.
The recursive case is the general form of the recursive problem. In this case the problem needs to be broken down by one step toward the base case, and the algorithm makes a recursive call to itself to solve this slightly smaller problem. This process repeats until the base case is reached.
Passing responsibility for error handling from one function to another higher-level function.
The process by which an error moves up the call stack until it is caught.
A built-in Python exception that occurs when a number is divided by zero.
The sequence of function calls that leads to the current point of execution in a program.
