Learn Buckland

Start Here

Begin with broad courses that introduce the fundamentals before moving into focused lessons.

Practice Concepts

Use lesson transcripts and key concepts to review specific ideas and reinforce your understanding.

Go Deeper

Follow related courses and topic links to build a wider learning path around Buckland.

Hymn for the Weekend

Provided to YouTube by Parlophone UK Hymn for the Weekend · Coldplay A Head Full of Dreams ℗ under exclusive licence to Parlophone Records Limited, ℗...

39: Things Go Wrong, Heaps - Richard Buckland UNSW

38: Balanced Trees - Richard Buckland UNSW

Approaches to Balancing Trees. Rotations, Splay Trees. Treaps. Heaps. Types of heaps, representing heaps. Operations on heaps. Lecture 38 of Computing...

37: Balancing - Richard Buckland UNSW

Comp1927 lecture 37 Balance. Implications of balanced and unbalanced tress. Also Teamwork. Blame. Complaining.

36: Puzzles and Protocols (with Movie) - Richard Buckland UNSW

An extension lecture. Just for fun. Not examinable. Directors cut: Now with the protocol movie clip at the end (jump to 17:35)

not a lecture: just chitchat about the project and misc before extension lecture 36

this was not a real lecture - it was just some miscellaneous chitchat before the extension lecture started. Rupert and Thurston recorded it as we were...

35b: Numerical Algorithms II - Richard Buckland UNSW

I love this lecture (of which this video is the second half). Janet asked me if she could do it just before the lecture started - ofcourse I said yes!

35a: The loneliest number - Richard Buckland UNSW

This is the first part of Lecture 35 in Computing2: The Science of Computer Science aka Comp1927 Data Structures and Algorithms.

34b: Numerical Algorithms I - Richard Buckland UNSW

Introduction to numerical algorithms Lecture 34 comp1927 "computing2"

34a: Controlling Errors - Richard Buckland, UNSW

This is the first part of lecture 34 comp1927 data structures and algorithms. It's about the major project - in it we discuss a central engineering th...

33b: Graph Algorithms and Skepticism - Richard Buckland, UNSW

Lecture 33 of Computing2 - Data Structures and Algorithms. In this lecture we ask "How can we know if Prim's MST algorithm is correct?"

33a: admin only - Richard Buckland UNSW

the start of lecture 33 of comp1927. This is just the course admin stuff at the start of the lecture which is probably not interesting to anyone not t...