UoL CS Notes

Menu

Archive - Lectures

2023

May 05 Generative Models - COMP324
Apr 21 Recommenders - COMP315
Apr 18 Accelerators (GPUs) - COMP
Apr 18 Bots - COMP315
Mar 24 GDPR Individual Rights - COMP315
Mar 23 Voronoi Diagrams - COMP324
Mar 23 Network Measures - COMP324
Mar 21 OpenMP Barriers - COMP328
Mar 20 Support Vector Machines - ELEC320
Mar 20 Privacy (GDPR) - COMP315
Mar 17 OpenMP `parallel` `for` - COMP328
Mar 17 Security Metadata - COMP315
Mar 14 OpenMP (Processes vs. Threads) - COMP328
Mar 10 Radial Basis Function Training (RBF NN) - ELEC320
Mar 10 MPI Barrier - COMP328
Mar 10 Security - COMP315
Mar 10 Zero Knowledge Proofs & Side Channels - COMP315
Mar 07 MPI Messages - COMP328
Mar 06 Radial Basis Function Networks - ELEC320
Mar 06 The Planted Degree Model - COMP324
Mar 06 Models of Complex Networks - COMP324
Mar 06 Cryptography (Not Encryption) - COMP315
Mar 06 Symmetric Key Encryption & Quantum Computers - COMP315
Mar 03 RSA Example - COMP315
Mar 02 Social Network Case Studies - COMP324
Feb 28 Multi-Layer Perceptron Training - ELEC320
Feb 28 Multi-Layer Perceptrons - ELEC320
Feb 28 Message Passing Interface (MPI) Introduction - COMP328
Feb 24 Public Key Encryption (One Time Pad & RSA) - COMP315
Feb 23 Power Laws - COMP324
Feb 23 Paths and Small Worlds - COMP324
Feb 23 Components & Giants - COMP324
Feb 21 Scaling & Efficiency - COMP328
Feb 20 Encryption Basics & History - COMP315
Feb 17 Single Layer Perceptrons - ELEC320
Feb 17 Parallelism - COMP328
Feb 17 Alternatives to Auctions - COMP315
Feb 17 Reverse & Double Auctions - COMP315
Feb 16 Cliques & Network Associativity - COMP324
Feb 16 Centrality - Important Nodes - COMP324
Feb 14 Compiler Optimisations - COMP328
Feb 13 Auction Misbehaviour - COMP315
Feb 10 Additional Auction Theory - COMP315
Feb 07 Computer Architectures - COMP328
Feb 07 Measuring Performance of Code - COMP328
Feb 07 Bidding Strategy (Other Auctions) - COMP315
Feb 06 Learning Processes - ELEC320
Feb 06 Degrees and Connectivity of Networks - COMP324
Feb 06 Bidding Strategy (English Auctions) - COMP315
Feb 03 Neural Network Structure - ELEC320
Feb 03 Terminology and Performance Optimisation - COMP328
Feb 03 Auctions & Negotiations - COMP315
Feb 02 Types of Networks and Planar Networks - COMP324
Jan 31 High-Performance Computing Introduction - COMP328
Jan 31 Technology Serving Business - COMP315
Jan 31 Business Models - COMP315
Jan 30 Neural Networks Introduction - ELEC320
Jan 30 E-Commerce Taxonomy - COMP315
Jan 30 E-Commerce Introduction - COMP315

2022

Nov 30 Image Compression - ELEC319
Nov 24 Description Logic - Tableaux Method - COMP304
Nov 23 Image Segmentation - ELEC319
Nov 21 Description Logic - Consistency, Coherence, Entailment & Reduction - COMP304
Nov 17 Edge Detection - ELEC319
Nov 17 Description Logic - TBoxes & ABoxes - COMP304
Nov 16 Building Maps - COMP329
Nov 14 Description Logic - COMP304
Nov 10 Particle Filters - COMP329
Nov 09 Grid Localisation - COMP329
Nov 04 Obstacle Avoidance - COMP329
Nov 03 Image Enhancement - ELEC319
Nov 03 Maps, Navigation & Path-finding - COMP329
Nov 03 Epistemic Logic - Common Knowledge & Public Announcements - COMP304
Nov 02 Connecting Features - COMP329
Oct 27 Noise Filtering - ELEC319
Oct 27 Markov Localisation - COMP329
Oct 27 Landmark Detection - COMP329
Oct 27 Epsitemic Logic - The Proof System $S5$ - COMP304
Oct 24 Epistemic Logic - COMP304
Oct 20 Scan Model & Likelihood Fields - COMP329
Oct 20 Formula Games - COMP304
Oct 19 Morphological Operations - ELEC319
Oct 19 Sensor Beam Model - COMP329
Oct 19 Sample Odometry Motion Model - COMP329
Oct 17 Modal Logic - The Proof System $\mathbf K$ - COMP304
Oct 15 Sensors & Perception - COMP329
Oct 15 Proportional integral Derivative Feedback Control (PID Control) - COMP329
Oct 13 Shapes & Connectivity - ELEC319
Oct 13 Modal Logic - Validity, Counterexamples & Satisfyability - COMP304
Oct 12 Odometry & Wheel Encoders - COMP329
Oct 10 Modal Logic - Multi-Agent - COMP304
Oct 07 Modelling Actions & Bayesian Filters - COMP329
Oct 07 State Estimation & Recursive Bayesian Updating - COMP329
Oct 06 Image Transformation - ELEC319
Oct 06 Image Histograms - ELEC319
Oct 06 Probability Theory & Bayes Theroem - COMP329
Oct 06 Modal Logic - Possible Worlds - COMP304
Oct 05 Kinematics of Differential Drives - COMP329
Oct 05 Wheeled Motion - COMP329
Oct 03 Potential Fields & Hybrid Architectures - COMP329
Oct 03 Subsumption Architecture - COMP329
Oct 03 Modal Logic - COMP304
Sep 30 Robot Control Architectures - COMP329
Sep 29 Human Vision - ELEC319
Sep 29 Agents & Robots - COMP329
Sep 29 Propositional Logic - COMP304
Sep 28 Image Processing - ELEC319
May 14 Number Theory & Cryptography - COMP202
May 07 Bipartite Graphs - COMP202
May 07 Network Flows - Maximum Flow, Ford-Fulkerson, Residual Paths & Augmenting Paths - COMP202
Apr 26 C# Design Patterns (MVC, Factory & Decorator) - COMP282
Mar 28 Refactoring - COMP285
Mar 28 Introduction to C# - COMP282
Mar 28 Graphs - COMP202
Mar 22 Event-Driven Programs - COMP284
Mar 22 Standard Template Library - Algorithms - COMP282
Mar 21 Standard Template Library - Containers & Iterators - COMP282
Mar 18 Dynamic Web Pages Using JavaScript - COMP284
Mar 15 JavaScript - Functions, Libraries & Objects - COMP284
Mar 15 C++ Overloading Continued & Templates - COMP282
Mar 14 Numeric Testing - COMP285
Mar 14 C++ Inheritance & Overloading - COMP282
Mar 11 JavaScript Control Structures & Arrays - COMP284
Mar 10 Dynamic Programming Applications - Fibonacci, Knapsack & Weighted Interval Scheduling - COMP202
Mar 08 JavaScript Introduction - COMP284
Mar 08 Classes in C++ - COMP282
Mar 08 Greedy Algorithm Applications - Knapsack, Scheduling, Clustering - COMP202
Mar 08 Divide & Conquer Applications - COMP202
Mar 07 Source Code Control - COMP285
Mar 07 Introduction to C++ - COMP282
Mar 04 The PDO Class (Databases in PHP) - COMP284
Mar 04 Dynamic Memory Allocation, Stack & Heap - COMP281
Mar 03 Testing Principles - Types of Testing & Bug Reports - COMP285
Mar 03 Custom Types, String Functions & Storage Classes - COMP281
Mar 02 Testing Principles - COMP285
Mar 02 Capturing JUnit Test Results - COMP285
Mar 01 PHP Classes & Objects - COMP284
Feb 28 Testing with JUnit & Ant - COMP285
Feb 25 Ant Filesets and Path - COMP285
Feb 25 PHP Sessions - COMP284
Feb 25 Pointers - Arithmetic and Function Pointers - COMP281
Feb 24 Ant Properties, Datatypes & References - COMP285
Feb 24 Pointer Basics - COMP281
Feb 22 HTML Forms & PHP - COMP284
Feb 22 Divide & Conquer Running Time - COMP202
Feb 21 Testing Theory - COMP285
Feb 18 PHP Regular Expressions - COMP284
Feb 18 Arrays & Debugging in C - COMP281
Feb 18 Sorting - Bucket & Radix Sort - COMP202
Feb 17 Ant Structured Build - COMP285
Feb 17 Functions in C - COMP281
Feb 17 Sorting - Counting Inversions & Quick Sort - COMP202
Feb 15 Control Structures, Functions & Libraries - COMP284
Feb 15 Sorting - Priority Queues, Heap Sort & Counting Inversions - COMP202
Feb 14 Ant Basics - COMP285
Feb 11 PHP - Arrays, Comparisons, Printing & NULL - COMP284
Feb 11 Loops in C - COMP281
Feb 11 AVL & (2, 4) Trees - COMP202
Feb 10 Introduction to Ant - COMP285
Feb 10 C Language Basics - COMP281
Feb 09 Continuous Integration & Automated Testing - COMP285
Feb 08 PHP Introduction - COMP284
Feb 08 Binary Search Trees - COMP202
Feb 07 Programming Methodologies - COMP285
Feb 06 CGI Programming and HTML Forms - COMP284
Feb 04 C Basics and Compiling - COMP281
Feb 04 Proof Techniques - COMP202
Feb 03 Introduction to C and Memory Management - COMP281
Feb 03 Asymptotic Notation - COMP202
Feb 02 CASE - Testing & Debugging Tools - COMP285
Feb 01 Introduction to Scripting Languages - COMP284
Feb 01 Algorithm Analysis Introduction - COMP202
Jan 31 Introduction to CASE Tools - COMP285

2021

Dec 09 The Chomsky Hierarchy - COMP218
Dec 09 Undecidability of CFG Ambiguity - COMP218
Dec 07 Market Basket Model - COMP207
Dec 07 Data-Mining - COMP207
Dec 07 Data Analysis - COMP207
Dec 06 Other NoSQL Databases - COMP207
Dec 06 Key-Value Stores - COMP207
Dec 06 NoSQL Databases - COMP207
Dec 06 Convert XML to SQL - COMP207
Dec 03 Undecidable Problems for CFGs - COMP218
Dec 03 Reducability - COMP218
Dec 01 Software Cost Estimation - COMP201
Dec 01 Project Management - COMP201
Nov 30 Advanced XQuery - COMP207
Nov 30 XQuery Basics - COMP207
Nov 30 Advanced XPaths - COMP207
Nov 30 XPath Basics - COMP207
Nov 30 XML Schema - COMP207
Nov 30 Document Type Definitions (DTD) - COMP207
Nov 29 WiFi Security - COMP211
Nov 29 Transport-Layer Security (TLS) - COMP211
Nov 29 Secure Email - COMP211
Nov 29 Integrity & Digital Signatures - COMP211
Nov 29 Authentication - COMP211
Nov 29 Basics of XML - COMP207
Nov 29 Semi-Structured Data - COMP207
Nov 27 Unrecognisable Languages - COMP218
Nov 27 Turing's Theorem - COMP218
Nov 27 Universal Turing Machines & Undecidability - COMP218
Nov 26 Decidable & Undecidable Languages - COMP218
Nov 26 Running Time (P vs NP) - COMP218
Nov 26 Random Access Machines - COMP218
Nov 26 Variants of Turing Machines - COMP218
Nov 24 Software Testing - COMP201
Nov 24 Verification & Validation - COMP201
Nov 23 MapReduce - COMP207
Nov 23 Query Processing for DDBMS - COMP207
Nov 23 Trasaction Management in DDBMS - COMP207
Nov 23 Fragmentation, Replication & Transparency - COMP207
Nov 23 Introduction to Distributed Databases - COMP207
Nov 22 Programming Turing Machines - COMP218
Nov 22 Turing Machines - COMP218
Nov 22 Public Key Cryptography - COMP211
Nov 22 Symmetric Key Cryptography - COMP211
Nov 22 Network Security Introduction - COMP211
Nov 19 Regular Closure of CFLs - COMP218
Nov 19 Closure Properties of Context-Free Languages - COMP218
Nov 19 Pumping Lemma for GFGs - COMP218
Nov 18 COMP218 - PDA to CFG Conversion - COMP218
Nov 17 CFG to PDA Conversions - COMP218
Nov 17 Interaction Diagrams - Collaboration, Sequence & Activity Diagrams - COMP201
Nov 17 Class Diagrams - 2 - COMP201
Nov 17 Class Diagrams - 1 - COMP201
Nov 16 Physical Query Plans - COMP207
Nov 16 Optimising Query Plans - COMP207
Nov 16 Deletion & Properties of B+ Trees - COMP207
Nov 16 Searching & Inserting in B+ Trees - COMP207
Nov 16 Index - COMP207
Nov 16 External Memory Merge-Sort - COMP207
Nov 16 Computing Joins Using Sorting - COMP207
Nov 16 Naïve Query Plan Execution - COMP207
Nov 16 Introduction to Query Processing - COMP207
Nov 15 Pushdown Automata - COMP218
Nov 15 Probabilistic CFGs - COMP218
Nov 15 Physical Layer - Transmission Media - COMP211
Nov 15 Physical Layer - Data Rate Limits - COMP211
Nov 15 Physical Layer - Transmission Impairments - COMP211
Nov 15 Physical Layer - Data Signals - COMP211
Nov 13 Case Study Example & Noun Identification Technique - COMP201
Nov 13 Concepts of Object Oriented Design - COMP201
Nov 12 Link Layer (Summary) - COMP211
Nov 11 Network Layer - Control Plane (Summary) - COMP211
Nov 10 Network Layer - Data Plane (Summary) - COMP211
Nov 10 Evolution of Transport Layer Functionality - COMP211
Nov 10 Congestion Control - COMP211
Nov 10 Flow Control & Connection Management - COMP211
Nov 05 Cocke-Younger-Kasami (CYK) Algorithm - COMP218
Nov 05 Chomsky Normal Form - COMP218
Nov 05 Parsing Context Free Grammars - COMP218
Nov 05 Context Free Grammar Ambiguity - COMP218
Nov 05 Context-Free vs. Regular Languages - COMP218
Nov 05 Context-Free Grammars - COMP218
Nov 03 Distributed System Architectures - 2 - COMP201
Nov 02 Timestamp Based Schedules - COMP207
Nov 02 Detecting Deadlocks - COMP207
Nov 02 Avoiding Cascading Rollbacks - COMP207
Nov 02 Recoverable Schedules - COMP207
Nov 02 Checkpoints - COMP207
Nov 01 Connection-Oriented Transport (TCP) - COMP211
Nov 01 Reliable Data Transfer (Stop & Wait) - COMP211
Nov 01 Reliable Data Transfer (Stop & Wait) - COMP211
Nov 01 Connection-less Transport (UDP) - COMP211
Nov 01 Multiplexing & Demultiplexing - COMP211
Oct 28 Context-Free Languages - COMP218
Oct 27 Distributed System Architectures - 1 - COMP201
Oct 27 Principles of Good Modular Design (Coupling, Cohesion & Encapsulation) - COMP201
Oct 27 Stages of Design & Modular Programming - COMP201
Oct 26 Other Kinds of Logging (Redo & Undo/Redo) - COMP207
Oct 26 Undo Logging - COMP207
Oct 26 Aborting Transacions - COMP207
Oct 26 More Flexible Locks, Deadlock & Granularity - COMP207
Oct 26 2PL Conflict-Serialisability Proof - COMP207
Oct 26 Locking Conflict-Serialisable Schedules - COMP207
Oct 25 Transport Layer Services - COMP211
Oct 21 Why DFA Minimisation Works - COMP218
Oct 21 DFA Minimisation General Algorithm - COMP218
Oct 21 DFA Minimisation - COMP218
Oct 21 Pumping Lemma Game - COMP218
Oct 21 Non-Regular Languages - COMP218
Oct 20 Formal Specifications - Abstract State Machine Model Language (ASML) - COMP201
Oct 20 Formal Specifications - COMP201
Oct 19 Recognising Conflict-Serialisable Schedules - COMP207
Oct 19 Conflict Serialisable Schedules - COMP207
Oct 19 Serialisable Schedules - COMP207
Oct 19 ACID (In Detail) - COMP207
Oct 19 ACID (Schedule & Transaction Issues) - COMP207
Oct 19 Schedules - COMP207
Oct 19 Introduction to Transactions - COMP207
Oct 16 Decision & Closure Properties - COMP218
Oct 16 $\epsilon$-NFA to Regex Translation - COMP218
Oct 15 Regex to $\epsilon$-NFA Conversion - COMP218
Oct 15 High Level Petri Nets - COMP201
Oct 14 Tutorial 2 - COMP207
Oct 13 Modelling Based on Petri Nets - COMP201
Oct 13 System Models (Mealy, Moore, Petri Nets & UML Diagrams) - COMP201
Oct 13 System Models (Process Models, Data Flow & State Machines) - COMP201
Oct 12 Java Socket Programming - TCP - COMP211
Oct 12 Java Socket Programming - UDP - COMP211
Oct 12 Peer-to-Peer (P2P) Applications - COMP211
Oct 12 DNS (Domain Name System) - COMP211
Oct 12 Cookies & Web-Caches (Proxy Servers) - COMP211
Oct 12 HTTP Overview & Persistent vs. Non-Persistent - COMP211
Oct 09 SQL Queries - Misc. - COMP207
Oct 08 Analysing Regular Expressions - COMP218
Oct 08 Java Socket Programming Recap & Assignment 1 - COMP211
Oct 08 Security Requirements - COMP201
Oct 06 Definition of Regular Expressions - COMP218
Oct 06 $\epsilon$-NFA to NFA Conversion - COMP218
Oct 06 The Application Layer - Transport Services - COMP211
Oct 06 The Application Layer - Architectures & Processes - COMP211
Oct 06 UNION - COMP207
Oct 05 SQL Queries (Optional Part) - COMP207
Oct 05 Requirements Engineering Process - COMP201
Oct 04 NFA to DFA Conversion (Determinisation) - COMP218
Oct 04 SQL Queries (Required Part) - COMP207
Oct 04 Software Requirements - COMP201
Oct 01 Nondeterministic Finite Automata (NFAs) & Epsilon-NFAs - COMP218
Oct 01 Protocol Layers & Reference Models - COMP211
Oct 01 History - COMP211
Sep 29 Security - COMP211
Sep 29 Performance - Loss, Delay & Throughput - COMP211
Sep 29 SQL Data Manipulation Language (DML) - COMP207
Sep 29 Software Processes - COMP201
Sep 28 Deterministic Finite Automata (DFAs) - COMP218
Sep 28 The Network Core - COMP211
Sep 28 SQL DDL (Data Definition Language) - COMP207
Sep 28 Software Processes & Development - COMP201
Sep 27 Preliminaries of Automata Theory & Set Theory - COMP218
Sep 27 Module Overview & Automata Types - COMP218
Sep 27 The Network Edge - COMP211
Sep 27 Introduction to Computer Networks - COMP211
Sep 27 Introduction to SQL - COMP207
Sep 27 Functional Requirements and Use Case Analysis - COMP201
Sep 26 Introduction - COMP207
May 28 Practice Exam Answers - COMP124
May 13 Compiler Implementation - COMP124
May 12 Grammars - COMP124
May 11 Language Components - COMP124
May 10 Compilers & Interpreters - COMP124
May 07 Performance Considerations - COMP124
May 06 Virtual Memory & Working Sets - COMP124
May 06 Paging - COMP124
May 06 Dynamic Programming Algorithms - 2 - Assembly Line Scheduling - COMP108
May 05 Segmentation - COMP124
May 05 Dynamic Loading - COMP124
May 05 Dynamic Programming Algorithms - 1 - Fibonacci Numbers - COMP108
May 04 Memory Fragmentation - COMP124
May 04 Memory Management - COMP124
Apr 30 Handling Deadlock - COMP124
Apr 29 Deadlock - COMP124
Apr 29 Divide & Conquer Algorithms - 4 - Recurrence - COMP108
Apr 29 Divide & Conquer Algorithms - 3 - Fibonacci Numbers - COMP108
Apr 28 Dining Philosophers Problem - Java Code - COMP124
Apr 28 Divide & Conquer Algorithms - 2 - Merge Sort - COMP108
Apr 28 Divide & Conquer Algorithms - 1 - Introduction - COMP108
Apr 27 Dining Philosophers Problem - COMP124
Apr 26 Streams - COMP122
Apr 26 Files - COMP122
Apr 22 Synchronised Methods - COMP124
Apr 22 Producer-Consumer Problem - COMP124
Apr 22 Spectral Methods - SVD & Image Compression - COMP116
Apr 22 Spectral Methods - Google's Page Rank Algorithm - COMP116
Apr 22 Greedy Algorithm - 3 - Single-Source Shortest Paths - COMP108
Apr 22 Greedy Algorithm - 2 - Minimum Spanning Tree - COMP108
Apr 21 Semaphores & Signals - COMP124
Apr 21 Synchronisation Problems - COMP124
Apr 21 Computing Eigenvalues & Eigenvectors - COMP116
Apr 21 Greedy Algorithm - 1 - Knapsack Problem - COMP108
Apr 20 Concurrent Programming - COMP124
Apr 20 Threads - COMP124
Apr 20 Spectral Methods - COMP116
Apr 19 Exceptions - 2 - Exceptions in Java - COMP122
Apr 19 Exceptions - 1 - Code Patterns - COMP122
Apr 17 Iterators - COMP122
Apr 17 Collections (Generics, Stacks, Hash Maps) - COMP122
Apr 16 Graphs - 4 - Traversals - COMP108
Apr 16 Graphs - 3 - Paths & Circuits - COMP108
Apr 14 Graphs - 2 - Representation of Graphs - COMP108
Apr 14 Graphs - 1 - COMP108
Mar 19 I/O Scheduling - COMP124
Mar 18 Device Management - COMP124
Mar 18 File Allocation Methods - COMP124
Mar 18 Regression & Data Analysis - COMP116
Mar 18 Trees - 3 - Applications - COMP108
Mar 18 Trees - 2 - Binary Trees - COMP108
Mar 18 Trees - 1 - COMP108
Mar 16 File Management - COMP124
Mar 16 Statistical Measures - Expectation, Variance & Standard Deviation - COMP116
Mar 15 Interfaces - COMP122
Mar 15 Abstract Classes - COMP122
Mar 15 Statistics & Data Analysis - COMP116
Mar 12 Round Robin - COMP124
Mar 11 Priority Scheduling - COMP124
Mar 11 Insertion Sort - COMP108
Mar 11 Selection Sort - COMP108
Mar 10 Scheduling Algorithms - COMP124
Mar 10 Bubble Sort - 2 - COMP108
Mar 10 Bubble Sort - 1 - COMP108
Mar 09 Process Scheduling - COMP124
Mar 08 Polymorphism - COMP122
Mar 08 Method Overriding - COMP122
Mar 08 Subclasses - COMP122
Mar 06 Inter-process Communication - COMP124
Mar 06 Process Creation - COMP124
Mar 06 Process States - COMP124
Mar 06 Subsystem Managers - COMP124
Mar 06 Operating Systems Overview - COMP124
Mar 06 Computer Creativity - COMP116
Mar 06 Quaternions and 3D Graphics - COMP116
Mar 05 Processes & Interrupts - COMP124
Mar 05 Evolution of Operating Systems - COMP124
Mar 05 Linked Lists - 4 (Summary) - COMP108
Mar 05 Linked Lists - 3 (Deletion) - COMP108
Mar 04 Complex Valued Functions - 2 (Integral Calculus) - COMP116
Mar 04 Complex Valued Functions - 1 (Differential Calculus) - COMP116
Mar 04 The Fourier Transform & Fast Arithmetic - COMP116
Mar 04 Linked Lists - 2 (Insertion) - COMP108
Mar 04 Linked Lists - 1 (Searching) - COMP108
Mar 02 Class Variables & Methods - COMP122
Mar 02 Encapsulation - COMP122
Mar 02 Constructors - COMP122
Mar 02 Classes - COMP122
Mar 02 Objects - COMP122
Mar 01 Complex Number Representations - COMP116
Mar 01 Introduction to Complex Numbers - COMP116
Feb 26 Recursion - COMP124
Feb 26 Stack Frames - COMP124
Feb 25 Calling External Subroutines for I/O - COMP124
Feb 25 Queues & Stacks - 2 - COMP108
Feb 25 Queues & Stacks - 1 - COMP108
Feb 24 Subroutine Parameters - COMP124
Feb 24 Machine Level Stacks - COMP124
Feb 24 Arrays - 2D Arrays - COMP108
Feb 24 Arrays - Finding Max/Min - COMP108
Feb 23 Nested Calls & The Call Stack - COMP124
Feb 23 Subroutines - COMP124
Feb 22 Imports, Packages & the Classpath - COMP122
Feb 22 Loops - COMP122
Feb 22 Methods - COMP122
Feb 18 Variable Addressing & Arrays - COMP124
Feb 18 Partial Derivatives & Multi-variable Functions - COMP116
Feb 18 Arrays - Binary Search - COMP108
Feb 18 Arrays - Sequential Search - COMP108
Feb 17 Loops - COMP124
Feb 17 Register Flags, Jumps & Conditions - COMP124
Feb 17 Conditionals - COMP122
Feb 17 Arrays - COMP122
Feb 17 Variables - COMP122
Feb 17 Data Types - COMP122
Feb 17 Algorithm Efficiency - 2 - COMP108
Feb 17 Algorithm Efficiency - 1 - COMP108
Feb 16 Intel x86 Assembly Language & Registers - COMP124
Feb 16 Machine Language Instruction Sets - COMP124
Feb 15 The CPU & Fetch-Execute Cycle - COMP124
Feb 15 Overview of System Architecture - COMP124
Feb 11 Pseudo Code - 2 - COMP108
Feb 10 Pseudo Code - 1 - COMP108
Feb 09 Java Syntax - COMP122
Feb 09 Running Java Code - COMP122
Feb 05 Week 1 Summary - COMP116
Feb 05 Linear Transformations & Their Role in Computer Graphics - COMP116
Jan 28 Vector Spaces - COMP116
Jan 28 Vectors & Vector Operations - COMP116
Jan 24 Polynomials & their Properties - COMP116
Jan 24 Numbers & Number Types - COMP116
Jan 04 Lecture 29 - COMP105

2020

Dec 19 Copyrights & Database Rights - COMP107
Dec 18 Free and Open Source Software - COMP107
Dec 18 Intellectual Property - COMP107
Dec 17 Counting - 4 - COMP109
Dec 17 Counting - 3 - COMP109
Dec 17 Cyberethics - 3 - COMP107
Dec 17 Cyberethics - 2 - COMP107
Dec 17 Cyberethics - 1 - COMP107
Dec 17 Lecture 27 - COMP105
Dec 16 Counting - 2 - COMP109
Dec 16 Counting - 1 - COMP109
Dec 14 Lecture 26-2 - COMP105
Dec 14 Lecture 26-1 - COMP105
Dec 11 Quality Test for Relational DBs - COMP107
Dec 11 Lecture 25 - COMP105
Dec 10 Nearest Neighbour Classifier - 2 - COMP111
Dec 10 Nearest Neighbour Classifier - 1 - COMP111
Dec 09 Logic - 7 - COMP109
Dec 09 Relational DB Quality - 2 - COMP107
Dec 09 Relational DB Quality - 1 - COMP107
Dec 08 Naive Bayes Classifier - 2 - COMP111
Dec 08 Naive Bayes Classifier - 1 - COMP111
Dec 08 Introduction to Learning - COMP111
Dec 07 Logic - 6 - COMP109
Dec 07 Logic - 5 - COMP109
Dec 06 Logical Design - 2 - COMP107
Dec 06 Logical Design - 1 - COMP107
Dec 04 The Relational Model - COMP107
Dec 04 Database Definitions Architecture - COMP107
Dec 04 Databases - COMP107
Dec 03 Logic - 4 - COMP109
Dec 03 Lecture 24-2 - COMP105
Dec 03 Lecture 24-1 - COMP105
Dec 02 Bayesian Networks - 2 - COMP111
Dec 02 Bayesian Networks - 1 - COMP111
Dec 02 Logic - 3 - COMP109
Dec 01 Independent Random Variables - COMP111
Dec 01 Lecture 23-2 - COMP105
Dec 01 Lecture 23-1 - COMP105
Nov 30 Logic - 2 - COMP109
Nov 30 Logic - 1 - COMP109
Nov 30 Lecture 22-2 - COMP105
Nov 30 Lecture 22-1 - COMP105
Nov 27 Relations - 10 - COMP109
Nov 27 Relations - 9 - COMP109
Nov 26 Relations - 8 - COMP109
Nov 26 Lecture 21-2 - COMP105
Nov 26 Lecture 21-1 - COMP105
Nov 25 Probabilistic Inference - COMP111
Nov 25 Joint Probability Distribution - COMP111
Nov 25 Relations - 7 - COMP109
Nov 25 Relations - 6 - COMP109
Nov 24 Introduction of Random Variables - COMP111
Nov 24 Relations - 5 - COMP109
Nov 24 Relations - 4 - COMP109
Nov 23 Relations - 3 - COMP109
Nov 23 Relations - 2 - COMP109
Nov 23 Lecture 19-2 - COMP105
Nov 23 Lecture 19-1 - COMP105
Nov 22 Relations - 1 - COMP109
Nov 22 Evolutionary Modelling - COMP107
Nov 19 Bayes' Theorem - COMP111
Nov 19 Independence - COMP111
Nov 19 Conditional Probability - COMP111
Nov 19 Lecture 18-2 - COMP105
Nov 19 Lecture 18-1 - COMP105
Nov 18 Probability of the Union of Events - COMP111
Nov 18 Events - COMP111
Nov 18 Reasoning Under Uncertainty - COMP111
Nov 18 Basic Definitions in the ER Model - COMP107
Nov 17 Functions - 8 - COMP109
Nov 17 Functions - 7 - COMP109
Nov 17 Functions - 6 - COMP109
Nov 17 Lecture 17-2 - COMP105
Nov 17 Lecture 17-1 - COMP105
Nov 16 Lecture 16-2 - COMP105
Nov 16 Lecture 16-1 - COMP105
Nov 13 Functions - 5 - COMP109
Nov 13 Functions - 4 - COMP109
Nov 13 Functions - 3 - COMP109
Nov 12 Propositional Knowledge Bases and Reasoning - COMP111
Nov 12 Satisfiability of Propositional Formulas - COMP111
Nov 12 Truth Values - COMP111
Nov 12 Propositional Logic - COMP111
Nov 12 Lecture 15-2 - COMP105
Nov 12 Lecture 15-1 - COMP105
Nov 11 Functions - 2 - COMP109
Nov 11 Functions - 1 - COMP109
Nov 11 Russell's Paradox - COMP109
Nov 11 Cardinality of Sets - COMP109
Nov 10 Lecture 14-3 - COMP105
Nov 10 Lecture 14-2 - COMP105
Nov 10 Lecture 14-1 - COMP105
Nov 09 Lecture 13-2 - COMP105
Nov 09 Lecture 13-1 - COMP105
Nov 06 Algebra of Sets - COMP109
Nov 06 Lecture 12-2 - COMP105
Nov 06 Lecture 12-1 - COMP105
Nov 05 Relations & Non-Unary Rule-Based Systems - COMP111
Nov 05 Derived Assertions Algorithm - COMP111
Nov 05 Rule Based Languages - COMP111
Nov 05 Basic Knowledge Representation and Reasoning - COMP111
Nov 04 Alpha - Beta Pruning - COMP111
Nov 04 Adversarial Search - COMP111
Nov 03 Set Operations - COMP109
Nov 03 Subsets and Set Equality. - COMP109
Nov 03 (Naive) Set Theory - COMP109
Nov 02 Lecture 10-2 - COMP105
Nov 02 Lecture 10-1 - COMP105
Oct 31 How to Cite - COMP107
Oct 31 How to Reference - COMP107
Oct 31 Evaluating and Gathering Information Sources - COMP107
Oct 29 Common Mistakes and Good Practice - COMP109
Oct 29 Strong Induction - COMP109
Oct 29 Proving Properties of Programs - COMP109
Oct 29 Lecture 9-3 - COMP105
Oct 29 Lecture 9-2 - COMP105
Oct 29 Lecture 9-1 - COMP105
Oct 28 A* Search - COMP111
Oct 28 Mathematical Induction - COMP109
Oct 28 Week 2 Summary Continued - COMP109
Oct 27 Informed Strategies - COMP111
Oct 27 Uniform Cost Search and Informed Tree Search - COMP111
Oct 27 Lecture 8-2 - COMP105
Oct 27 Lecture 8-1 - COMP105
Oct 26 Week 2 Summary - COMP109
Oct 26 Lecture 7-2 - COMP105
Oct 26 Lecture 7-1 - COMP105
Oct 25 Continuation of Week 1 Summary - COMP109
Oct 24 Week 1 Summary - COMP109
Oct 24 Requirement Elicitation - COMP107
Oct 22 System Analysis and Design - COMP107
Oct 22 Lecture 6-2 - COMP105
Oct 22 Lecture 6-1 - COMP105
Oct 21 Lecture 5-2 - COMP105
Oct 21 Lecture 5-1 - COMP105
Oct 20 Properties of Searches - COMP111
Oct 20 Depth First Search - COMP111
Oct 20 Breadth First Search - COMP111
Oct 19 Lecture 4-2 - COMP105
Oct 19 Lecture 4-1 - COMP105
Oct 14 Generic Search Algorithm in Pseudo-code - COMP111
Oct 14 Size of Search Graphs and Search Trees - COMP111
Oct 14 Search Graphs - COMP111
Oct 14 Lecture 3-2 - COMP105
Oct 14 Lecture 3-1 - COMP105
Oct 13 Classification of Intelligent Agents - COMP111
Oct 13 Intelligent Agents - COMP111
Oct 13 Lecture 2-2 - COMP105
Oct 13 Lecture 2-1 - COMP105
Oct 12 Views and History of AI - COMP111
Oct 12 Lecture 1-2 - COMP105
Oct 12 Lecture 1-1 - COMP105