Concepts
5,907Terms and methods explained by more than one lecturer. Each opens at the minute it is taught.
Systems & CS
189- Moore's lawThe observation that the number of transistors that can fit on a chip doubles approximately every two years.
- AbstractionThe concept of hiding internal implementation details and exposing only an interface to the user.
- RecursionA programming technique where a function calls itself to solve smaller instances of the same problem.
- ClosureA property of a means of combination where the results of combined elements can themselves be combined using the same means.
- MemoizationAn optimization technique used to speed up computer programs by storing the results of expensive function calls and returning the cached result when the same inputs occur again.
- GroupA set along with a binary operation that satisfies closure, associativity, the existence of an identity element, and the existence of an inverse for every element.
- Virtual memoryA mechanism that maps virtual addresses to physical addresses to provide isolation and memory management.
- Greatest common divisorThe greatest common divisor of two numbers is the largest positive integer that divides both numbers without a remainder.
- Hash functionA function that maps any object (or hashable object) to an integer.
- ModuleA WebAssembly package containing procedural game or server logic that can be dynamically updated at runtime.
- QueueA collection data structure operating on a first-in, first-out (FIFO) basis where new elements are added to the end and removed from the beginning.
- Race conditionA bug caused when multiple threads access shared data concurrently and at least one access is a write, leading to unpredictable results.
- StackAn abstract data type operating on a Last In, First Out (LIFO) basis.
- Digital signaturesA cryptographic mechanism to verify the authenticity and integrity of a message using a secret key to sign and a public key to verify.
- Big O notationA mathematical notation used to describe an upper bound on the growth of a function.
- Binary searchAn algorithm that finds the position of a target value within a sorted array by repeatedly dividing the search interval in half.
- IsolationThe property where execution of one transaction is isolated from that of other transactions ("all by myself").
- B-treeA B-tree is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time, optimized for systems that read and write large blocks of data.
- RangeA function that generates a sequence of integers following a pattern based on start, stop, and step arguments.
- SyntaxThe structure or grammar of a language, including word order rules that determine sentence meaning.
- Data abstractionA methodology that isolates the way data objects are used from the way they are represented.
- Object-oriented programmingA programming paradigm where everything is an object that can be created, manipulated, and destroyed.
- ThreadExecution units scheduled by the operating system, allowing multiple execution paths in a process.
- Functional programmingA programming paradigm that avoids side effects and mutable state, treating programs as mathematical functions.
- ConcatenationString concatenation uses the plus operator to combine the individual characters of two strings into one new string object.
- ContextA mapping of virtual to physical locations as dictated by the contents of the page map.
- Data raceA condition occurring when multiple threads access the same memory location concurrently and at least one of the accesses is a write, resulting in undefined behavior.
- Merge sortA sorting algorithm that recursively divides a list into two halves, sorts them, and then merges the sorted halves.
- SemanticsThe meaning or understanding attached to symbols, going beyond mere syntax.
- SemaphoreSemaphores are synchronization primitives that control access to shared resources between tasks by maintaining an internal counter.
- YieldA mechanism where the kernel pauses the current process to allow other processes to run.
- AlgorithmStep-by-step instructions for solving some problem.
- DebuggingThe process of writing code and eliminating bugs or mistakes in a computer program.
- DecompositionThe process of breaking a problem down into smaller, self-contained, and manageable parts or modules.
- AttributesExtra keywords and information attached to LLVM IR constructs like instructions, operands, functions, or parameters.
- Error-correcting codesECC detects and corrects low-bit errors in stored data by using redundant information called parity.
- Hash tableA data structure that uses a hash function to map keys to values, implemented as an array of linked lists.
- ListA conventional way of representing a sequence of things as a chain of pairs.
- Speculative executionA technique to improve the performance of CPUs where the CPU guesses a branch outcome and starts executing down that path before it knows whether it really should be executing it.
- TruncationThe phenomenon in integer division where any fractional part after the decimal point is discarded because the operation only uses integer-based math.
- VariableA named storage location in memory that holds a value.
- Base caseThe first part of an induction proof that shows the statement is true for the initial value, usually zero.
- CollisionA situation in a hash table where two different keys map to the same hash value.
- MemoryRandom access memory consists of bytes on circuit boards, functioning as a canvas of addressable storage locations.
- ObjectAn entity in Python that has an internal data representation and a set of procedures for interaction.
- ParameterA compile-time construct in Mojo similar to template arguments in C++, used to parameterize structs and functions.
- TransistorEssentially a switch just like a light switch, except it uses an electrical signal instead of a mechanical action to let electrical current flow or not.
- TupleA collection of values in Python that is immutable, meaning its values cannot be changed after creation.
- Virtual realityA computer-generated simulation of a three-dimensional environment that can be interacted with in a seemingly real or physical way.
- Declarative knowledgeKnowledge expressed as facts that are true for all time, without any inherent time sequence.
- Buffer overflowA vulnerability that occurs when a program writes more data to a buffer than it can hold, overwriting adjacent memory.
- CompilerA program that translates one language to another, such as source code to machine code.
- For loopA control flow statement for iterating over a sequence of values.
- IterationAn iterative process is one whose time complexity is proportional to the input and whose space complexity is constant ().
- MethodsFunctions that come built-in with specific data types or objects.
- ScopeA variable only existing in the context in which you defined it.
- While loopA control flow structure that repeatedly executes a block of code as long as a specified condition remains true.
- Assembly languageA low-level programming language that sits between C and machine code, containing human-readable instructions for a computer.
- Asymptotic complexityTheta notation denotes the asymptotic complexity of a function by looking at the dominant input term and dropping lower-order terms and constants.
- CommentsNotes to self or other humans written into code using // that are ignored by the compiler.
- Computer architectureTraditionally focused on the software-hardware interface and its implementation using microarchitecture.
- ExpressionAn operation in the query with zero or more input expressions that the optimizer evaluates for equivalence.
- Feedback loopA mechanism or person that provides honest criticism and information on how to improve.
- Formal parameterThe variable name specified in a function definition that acts as a placeholder for the actual values passed during a call.
- InheritanceA mechanism where a child class inherits all data and behaviors from its parent class.
- MapA general procedure that applies a given function to each element of a list and returns a new list of the results.
- Operator overloadingA feature of object-oriented programming where built-in operators like multiplication have customized behaviors when applied to user-defined types or objects like strings.
- Random access memoryThe physical memory hardware in a computer where data and program variables are stored.
- StringA sequence of characters stored together, represented as an array.
- Syntactic sugarSyntax within a programming language that is designed to make things easier to read or to express, while being an abbreviation for a more complex underlying construct.
- TransactionA sequence of operations on data that appears atomic to other users.
- -greedy algorithmAn algorithm that mostly acts greedily with probability while selecting a random action with probability , resulting in linear total regret.
- CachingStoring frequently accessed data in a faster, temporary storage layer to reduce load on the primary database.
- CheckpointA saved point in computation used to limit the scope of recomputation during failures.
- Condition variableA condition variable allows threads to synchronize based on the actual value of data, waiting until a specific condition becomes true
- CoreThe processing unit inside a CPU that performs arithmetic, logic, and memory operations.
- End-to-end encryptionA secure communication method where only the communicating users can read the messages, ensuring that intermediate servers or third parties cannot access the plaintext.
- ExceptionAn error raised during program execution when an unexpected condition is encountered.
- Function callA function call invokes a defined function by name and passes arguments, causing Python to execute the function body and return a value.
- Hyper-threadingA technology built into a CPU that makes a single physical core present itself as multiple logical cores to the operating system.
- Imperative knowledgeKnowledge that describes how to accomplish something through a sequence of steps or an algorithm.
- IteratorsProcedures that are called and yield values one after another until finished.
- JoinA SQL clause used to combine rows from two or more tables based on a related column between them.
- PhishingAn attack where a threat actor creates a realistic clone of a login interface to trick users into providing their credentials.
- ProcedureAn algorithm, a series of steps for computing something.
- ProtocolA stripped-down struct or class that defines functions and vars without any implementation or storage.
- Selection sortAn algorithm that repeatedly scans the unsorted portion of a list to find the smallest element and swaps it into its correct sorted position from left to right.
- SettersA function in some class that sets some value.
- Unit testingA software testing method by which individual units of source code are tested to determine whether they are fit for use.
- User-defined functionsUser-defined synchronous or asynchronous functions that operate on row-level data within the PixelTable runtime.
- RowHammerA phenomenon where repeatedly activating and deactivating a DRAM row causes disturbance errors in adjacent or neighboring rows.
- Return valueThe value that a function produces and provides back to the caller after it has finished executing.
- DictionaryA collection of keys and values that allows associating something with something else in Python.
- Higher-order proceduresProcedures that take other procedures as arguments or return procedures as results, capturing general patterns of combination.
- Memory leakA memory leak happens when a program allocates memory using malloc but never calls free to release it back to the system.
- ArrayA collection of data values that are stored contiguously in the computer's memory.
- Class variableA variable and its value that are shared between all instances of a class.
- ConditionalsProgram structures that allow execution of different code blocks based on whether a condition is true or false.
- Indentation in PythonIndentation is used syntactically in Python to define blocks of code and scope rather than curly braces.
- Instance variableData attributes defined with self.XXX that are accessible with dot notation for the lifetime of the object.
- InterpreterA program you install on your computer that reads source code top to bottom, left to right, and translates it into zeros and ones.
- LoopThe ability in Python and other programming languages to do something again and again in a cycle.
- Side effectsActions performed by a function, such as printing to the screen, that do not return a value.
- Type castingConverting an object from one data type to another, such as a Fraction to a float using __float__.
- AliasingAliasing occurs when two variables refer to the same mutable object in memory, so that changes made through one variable affect the other.
- Amortized costA way to express the time cost per operation on average over a sequence of multiple operations, such as spreading the cost of sorting a list across many subsequent searches.
- ASCIIA mapping from decimal numbers to letters and characters called the American Standard Code for Information Interchange.
- BooleanA data type that can only be true or false.
- Break statementA statement that breaks out of the most recently begun while loop.
- DHCPA network protocol used to configure devices dynamically for network connectivity.
- DocstringA multi-line comment using triple quotes that acts as a specification or contract for the function's inputs and outputs.
- Domain name systemA system that resolves domain names into IP addresses by sending requests to specialized servers.
- F-stringA formatted string literal that evaluates expressions inside curly braces at runtime and converts them to strings.
- FreeA function used to return previously allocated memory back to the operating system.
- IndexingSyntax that lets you go to a specific spot inside of an array, usually starting from zero up to n minus one.
- Input functionA function that prints a prompt string to the console, waits for user keyboard input, and returns that input as a string.
- KarmaThe belief that one's actions, specifically helping others, will eventually lead to positive outcomes for oneself.
- Len functionA Python function that returns the length or number of elements in a list or sequence.
- Order of growthThe rate at which the resource requirements of an algorithm grow as a function of the input size.
- PixelAn individual dot on a computer or phone screen that has associated numerical color values.
- PointerA variable whose purpose is to store the memory address of another variable.
- Recursive definitionA definition of a procedure or function in terms of itself, such as the exponentiation function calling itself.
- Regular expressionsA way of using patterns to validate inputs or to extract information from strings.
- Return statementA keyword used inside a function to end its execution and pass a resulting value back to the caller.
- ValgrindA tool used to check and diagnose memory usage and bugs in programs.
- __Init__ methodA special method used to initialize the contents and attributes of an object when it is instantiated from a class.
- __Str__ methodA special dunder method that returns a string representation of an object when it is printed or converted to a string.
- AliasAn alias occurs when multiple names refer to the exact same object in memory, meaning that modifying the object through one name affects all others.
- Big Theta notationA mathematical notation that bounds a function both from above and below by another function up to constant factors.
- C programming languageA foundational programming language used in CS50 for writing text-based code.
- Cache memorySmaller, faster volatile computer memory that the CPU can access more quickly than regular RAM, categorized into levels like L1, L2, and L3.
- CiphertextThe scrambled, encrypted text resulting from applying an encryption function to plaintext.
- ClassA blueprint or mold that allows you to invent your own custom data types in Python and give them a name.
- Data movement bottleneckThe performance and energy limitation caused by moving large amounts of data between storage/memory and processing units.
- DebuggerAn industry-standard tool used to examine and control program execution to find logical errors.
- DecryptionA mathematical process that transforms a seemingly random string of bits back into a readable message.
- Elif statementA conditional statement used to check multiple alternative conditions sequentially after an initial if statement.
- Exception handlingWriting code with error handling in mind to defensively anticipate and manage unexpected runtime errors.
- Flat file databaseStoring database tables as simple delimited text files on disk managed directly by application code.
- Floating point representationFloating point numbers are represented as a pair of integers consisting of significant digits and a base-2 exponent.
- Foreign keyAn attribute from one relation that maps to a tuple in another relation to enforce referential integrity.
- Full-disk encryptionEncryption method where data on a storage drive is entirely scrambled and requires initial authentication like a password to unlock.
- Function objectObjects of a class that overload the function call operator, allowing them to carry state and be easily inlined.
- GetterSimple functions that return the values of the data attributes that an object has.
- GROUP BYA clause used to project tuples into subsets or buckets based on specified parameters and compute aggregates against each subset.
- Infinite loopA loop that executes indefinitely because its terminating condition is never met or never changes to False.
- IterableAn interface requiring a class to provide an `iterator()` method, which allows the class to be used in an enhanced for-loop.
- Iterative algorithmA procedure for computation that uses constant space without accumulating deferred operations as arguments grow.
- Key spaceThe total number of possible unique keys or authentication factors in a system, often measured in bits of entropy.
- Lambda functionA lambda function is a way to create an anonymous function in one line without binding a name to it.
- LibraryA collection of pre-compiled code that someone else wrote that you can use in your own programs.
- Linear searchA brute-force search method that checks every element in a list sequentially until the desired element is found.
- Liskov substitution principleAn instance of a subclass can be used anywhere an instance of its parent class is expected, but the converse is not true.
- List comprehensionAn expression that allows you to very easily construct a list on the fly without using a loop or calling append repeatedly.
- Multi-threadingA technique where a processor switches between multiple threads of execution to hide memory latency.
- Nested queriesA query inside another SQL query, allowing the result of an inner query to be used as a condition for an outer query.
- Operating system kernelAn operating system kernel controls address spaces that can confine computations completely.
- OrA logical operator that evaluates to true if at least one of the connected conditions is true.
- PasskeysA passkey is a replacement for passwords that uses public key cryptography where a private key stays on the user's device and a public key is stored on the service.
- Performance counterA function typically used in the real world to figure out how long an actual program or a function takes to run with high accuracy.
- PipelineA mechanism that takes programs and sticks them together one after another to get a job done.
- PlaintextThe original, readable message before encryption or after decryption.
- Port numbersStandardized numeric identifiers that specify particular services provided by a server, such as HTTP or HTTPS.
- Pretty printingFormatting data nicely and indented on the screen for easier reading.
- Primary keyAn attribute or set of attributes in a relation that uniquely identifies a single tuple.
- Probability spaceThe set of all possible unknowns and behaviors that designers must accept and learn to work with.
- Procedure definitionProcedures can be defined and named using 'define' to encapsulate computations like squaring a number.
- Python moduleA file containing Python code, such as functions or variables, that can be imported and reused in other programs.
- Rainbow tableA precomputed dictionary storing potential inputs and their corresponding hash values to allow an adversary to reverse engineer hashes.
- Raising exceptionsThe programmer can use the raise keyword to explicitly trigger an exception when an error condition occurs.
- Reverse engineeringThe process of taking machine code or compiled binary and converting it back into source code.
- RGB color representationRepresenting color values on a 0 to 255 range using red, green, and blue numerical values for each pixel.
- RouterA special type of switch that translates and routes traffic from one network zone to another network zone.
- SaltingAdding random data to passwords before hashing them to make precomputed dictionary attacks and rainbow table lookups ineffective.
- SchemeThe protocol at the beginning of a URL that indicates how a resource is to be accessed, such as HTTPS.
- ShellA command-line interface that allows users to interact with the operating system and run programs.
- Side channel analysisAn implementation attack that measures physical quantities like power consumption or timing behavior to extract secret keys.
- SpecificationA specification, captured using docstrings, is a contract between the coder and the user detailing inputs, behavior, and outputs of a function.
- SQLA declarative or non-procedural language for interacting with a database system.
- String lengthThe number of characters in a string before the null character.
- String splittingSplitting one string into multiple parts based on a given character or delimiter using the split method.
- SuperA built-in function that allows a subclass to call methods or the initializer of its parent class.
- SwitchA networking device that allows multiple messages to be routed across switch ports from different hosts to different hosts.
- TCP/IPTCP and IP are network layer protocols used together to wrap and reliably route streams of data across the internet.
- Try/except blockA construct that wraps potentially problematic lines of code in a try block and executes an except block when an error occurs.
- Tuple unpackingMatching values on the right-hand side of an assignment to variables on the left-hand side separated by commas.
- Type hintAn annotation on a symbol or argument indicating its primitive type to optimize performance.
- Ubiquitous languageA common language between domain experts, users, and developers around a project or a product.
- Unicode codepointA numerical value represented in hexadecimal that uniquely identifies a character.