Ed's Notes
Search
Search
Dark mode
Light mode
Explorer
Year1
CS118
Lectures
Intro to CS118
Lecture x - Generics
TheGuide
CS126
Untitled
Lecture 1 - Module Overview
Heaps
Robin-Hood Hashing
CS130
Functions
Logic
ModuleOverview
Probability
Sets
CS131
Modular Arithmetic
CS132
flipflopstategenerator
Memory
CS139
FlashcardPrompts
Flashcards
CS141
Lecture 1 - History of Haskell
Year2
CS241
Content
Deadlocks
Module Details
Overview of Operating Systems
Processes
Transport Layer
CS254
Bipartite Graphs
Intro to AGT
Lecture 4
Lecture 7
Matching
CS255
Knowledge Representation
Planning With Uncertainty
Rational Agents
CS257
Intro
Lecture 4
Lecture 7
Lecture 8
Memory Systems
Optimisation
Untitled
CS258
Content
Integrity Constraints
Intro to SQL
Module Details
Relational Algebra
The Relational Model
Labs
JDBC
Psql
SQL
CS259
Context-Free Languages
DFAs & Regular Languages
GNFAs
Intro to Formal Languages
Languages
NFAs
Non-regularity
PDAs
Regular Expressions
Seminar 2
Turing Machines
CS260
Analysis of Algorithms
Complexity of Problems
Divide and Conquer
DP
Graphs
Greedy Algorithms
Intro to Algos
Module Details
P and NP
Reductions
CS261
Seminars
Seminar 1
Seminar 3
Coursework Advice
Intro to Software Engineering
Lecture 2 - Plan Driven
Lecture 3 - Agile Methodologies
Lecture 6 - UML
Lecture 7
CS262
Prolog
Facts, Rules, and Queries
Intro to Prolog
Intro to Prolog
Lecture 7
Normal Forms
Propositional Logic
CS266
Dimensionality Reduction
Fourier Transform
Interpolation
Intro to Data Analytics
Newton Forward Difference Formula
Newton Interpolation
CS275
Content
Basic Probability
Continuous Random Variables
Discrete Random Variables
LC
Kadane's Algorithm
MA241
Content
Basics for Enumerative Combinatorics
MA257
Lecture 3
MA267
Content
Cosets
Group Actions
Homomorphisms
Intro to Groups
Module Details
Personal To-Do List
Year3
CS355
Image Acquisition
Home
❯
Year2
❯
CS259
❯
Turing Machines
Turing Machines
Feb 18, 2025
1 min read
(Haven’t gotten to this yet)
Graph View
Backlinks
Intro to Formal Languages