String
One word, taught differently in 2 fields. Each use is given apart.
In Systems & CS
A sequence of characters stored together, represented as an array.
In Theory & Algos
A finite sequence of symbols from an alphabet.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
In Systems & CS
2Each in their own terms, from the easiest level.
David J. Malan
A sequence of text, characters, words, or paragraphs in a programming language.Ana Bell
A sequence of case-sensitive characters enclosed in quotation marks or single quotes.
In Theory & Algos
1Lectures that assume it
41The first 12 are shown.
- Exceptions
- Loops
- Conditionals
- Let's Build GPT: From Scratch, in Code, Spelled Out
- HTML, CSS, JavaScript
- Let's Build the GPT Tokenizer: Byte Pair Encoding & Unicode Internals
- Data Compression and Shannon’s Noiseless Coding Theorem
- Lists and Mutability in Python
- Functions as Objects
- Decomposition, Abstraction, and Functions
- Regular Expressions
- Hardness within P
Connections
53The lectures that define it or assume it, and the concepts next to it.
Concepts8
Show 2 moreShow fewer
Lectures45
- Functions, Variables
- Strings, Input/Output, and Branching in Python
- Introduction, Finite Automata, Regular Expressions
- Arrays
- Exceptions
- Loops
Show 39 moreShow fewer
- Conditionals
- Let's Build GPT: From Scratch, in Code, Spelled Out
- HTML, CSS, JavaScript
- Let's Build the GPT Tokenizer: Byte Pair Encoding & Unicode Internals
- Data Compression and Shannon’s Noiseless Coding Theorem
- Lists and Mutability in Python
- Functions as Objects
- Decomposition, Abstraction, and Functions
- Regular Expressions
- Hardness within P
- Tuning a TSP Algorithm
- Table Doubling, Karp-Rabin
- Course Overview and Formal Definition of Computation
- Python Classes
- Models of Computation, Random Access Machine & Document Distance
- C Programming
- Algorithms
- Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
- Category Theory 3.2: Kleisli Category
- Cryptography: Hash Functions
- Error Correcting Codes
- The Adversary Method in Quantum Query Complexity
- Strings
- Memory Management, Pointers, and Buffer Overflows
- Lambda Functions, Tuples, and Lists in Python
- Loops over Strings, Guess-and-Check, and Binary
- Memory
- TM Variants, Church-Turing Thesis
- Computation History Method
- Quantum Query Complexity
- Computational Models: Turing Machines
- Space Complexity, PSPACE, Savitch's Theorem
- Problems in P
- Et Cetera
- Python
- Inheritance
- HSE Kolmogorov Complexity, Lecture 1: Computability and Solomonoff Induction
- Sampling Techniques in SuperCollider (MUS 403, Week 4)
- Clean Code III: Functions