View Detailed Profile
COMP526 (Fall 2022) 4-2 §4.2 Brute force string matching algorithm

COMP526 (Fall 2022) 4-2 §4.2 Brute force string matching algorithm

See module website

COMP526 (Fall 2022) 2-4 §2.4 Operations on binary heaps

COMP526 (Fall 2022) 2-4 §2.4 Operations on binary heaps

See module website

COMP526 (Spring 2022) 4-2 §4.2 Brute force algorithm

COMP526 (Spring 2022) 4-2 §4.2 Brute force algorithm

See module website

COMP526 (Fall 2022) 4-4 §4.4 Constructing string matching automata

COMP526 (Fall 2022) 4-4 §4.4 Constructing string matching automata

See module website

COMP526 (Spring 2022) 2-4 §2.4 Operations on Binary Heaps

COMP526 (Spring 2022) 2-4 §2.4 Operations on Binary Heaps

Sorry, audio was not working during first 8min :(

COMP526 (Fall 2022) 2-3 §2.3 Priority queues and binary heaps

COMP526 (Fall 2022) 2-3 §2.3 Priority queues and binary heaps

See module website

COMP526 (Fall 2022) 4-3 §4.3 String matching with finite automata

COMP526 (Fall 2022) 4-3 §4.3 String matching with finite automata

See module website

COMP526 (Fall 2022) 0-4 §0.3 Mathematical induction

COMP526 (Fall 2022) 0-4 §0.3 Mathematical induction

See module website

COMP526 (Fall 2022) 4-1 §4.1 Introduction to strings and string matching

COMP526 (Fall 2022) 4-1 §4.1 Introduction to strings and string matching

See module website

COMP526 (Fall 2022) 0-5 §0.4 Correctness proofs for programs

COMP526 (Fall 2022) 0-5 §0.4 Correctness proofs for programs

See module website

COMP526 Fall 2022 Lecture 18

COMP526 Fall 2022 Lecture 18

livestream of

COMP526 (Fall 2022) 4-5 §4.5 The Knuth Morris Pratt algorithm

COMP526 (Fall 2022) 4-5 §4.5 The Knuth Morris Pratt algorithm

See module website

COMP526 (Fall 2022) 6-5 §6.5 Suffix arrays

COMP526 (Fall 2022) 6-5 §6.5 Suffix arrays

See module website