Add to EJ Playlist  

Add to EJ Playlist  Approaches to Balancing Trees. Rotations, Splay Trees. Treaps. Heaps. Types of heaps, representing heaps. Operations on heaps. Lecture 38 of Computing2 (Comp1927) "Data Structures and Algorithms" by Richard Buckland, UNSW Australia. This class was recorded in September 2009.

Add to EJ Playlist  Comp1927 lecture 37 Balance. Implications of balanced and unbalanced tress. Also Teamwork. Blame. Complaining.

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

Add to EJ Playlist  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 having some troubles with the recording software (wirecast) and wanted to do a test session to try out a new setup they were hoping would be better. mainly i was chatting about keeping secrets from Dracula in the project for those interested, then some random things before the extension lecture started.

Add to EJ Playlist  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!

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

Add to EJ Playlist  Introduction to numerical algorithms Lecture 34 comp1927 "computing2"

Add to EJ Playlist  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 taking the course.

Add to EJ Playlist  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 theme: controlling errors

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

Add to EJ Playlist  This is an extension lecture for interested students - nothing examinable, it's just for fun. Lecture 32 "Computing 2" Comp1927 (This upload attempts to fix the audio sync problem in my first attempt.)

Add to EJ Playlist  This video explains a data-type used to represent an abstract "Pile of Cards" (using a C linked list). It is broken into 2 short parts - this is part 2. This was used back in semester 1 of 2006 for the major project in UNSW's introductory programming course "Computing 1". The pile of cards was just an abstract linked list. In it I try to explain: "Why are these type definitions used?" and "What is going on here with abstraction?" background: I made the video when I got home after giving a lecture while suffering from a mild cold (or some similar excuse) and realised I'd done a poor job of explaining the types during the lecture. Watching this video was a second chance for the poor students to understand what was going on with the types.

Add to EJ Playlist  This video explains a data-type used to represent an abstract "Pile of Cards" (using a C linked list). It is broken into 2 short parts - this is part 1. This was used back in semester 1 of 2006 for the major project in UNSW's introductory programming course "Computing 1". The pile of cards was just an abstract linked list. In it I try to explain: "Why are these type definitions used?" and "What is going on here with abstraction?" background: I made the video when I got home after giving a lecture while suffering from a mild cold (or some similar excuse) and realised I'd done a poor job of explaining the types during the lecture. Watching this video was a second chance for the poor students to understand what was going on with the types.

Add to EJ Playlist  Lecture 31 Computing 2 (Comp1927) Some simple problems on graphs. Spanning trees. Threading a maze. (it looks like video still being processed - sound is clipping at the moment).

Add to EJ Playlist  Computing 2 - Lecture 30: Task 2 and Project Admin Richard talks about the steps in the course project. This is just a course admin lecture but you might be interested in it if you are thinking of giving the project a try yourself.

Add to EJ Playlist  

Add to EJ Playlist  A fish, that cannot dance a minuet, is contemptible. Sound patchy until 2:30

Add to EJ Playlist  

Add to EJ Playlist  

Add to EJ Playlist  

Add to EJ Playlist  Lecture 23 of comp1927 data structures and algorithms aka computing2. Searching searching searching... Searching leads us to hash tables and maybe even more. What dark horrors lurk ahead...??? Richard Buckland UNSW Computing recorded in 2009.

Add to EJ Playlist  Lecture 22 of comp1927 computing2 data structures and algorithms The difference between inside and outside (inside is drier when it is raining). Lecture by Richard Buckland UNSW Computing 2009

Add to EJ Playlist  This is lecture 21 of COMP1927 "Data Structures and Algorithms" by Richard Buckland UNSW.

Add to EJ Playlist  lecture 18 of comp1927 data structures and algorithms at the university of new south wales (UNSW)

Add to EJ Playlist  lecture 17 of comp1927 - data structures and algorithms

Add to EJ Playlist  Lecture 16 of Comp1929 Data Structures and Algorithms by Richard Buckland at UNSW 2009.

Add to EJ Playlist  The first half of Lecture 13 for comp1927 data structures and algorithms at UNSW. lecture concludes in 13b. (broken into halves due to recording equipment failure, 13a took a while to reconstruct - sorry about the delay)

Add to EJ Playlist  Lecture 14 of comp1927 data structures and algorithms