A selection of the course material is available at https://wiki.cse.unsw.edu.au/openlearning/computing2 This is the first lecture of COMP1927 Algorithms and Data Structures, which is the second computing course taken by first year computing students at UNSW. This course follows immediately on from COMP1917 (also available on youtube). These lectures are currently being recorded (August-November 2009).
Course
CS2: Data Structures and Algorithms - Richard Buckland
These are the 2009 lectures of COMP1927 Algorithms and Data Structures, aka Computing2 the second computing course taken by first year computing students at UNSW. This course follows immediately on from COMP1917 (also available on YouTube).These lectures were recorded August-November 2009 and are gradually being uploaded to youtube.A selection of the course material is available at www.openlearning.net All of the course material will eventually be available (once all the videos are posted)This course is followed by COMP2911 which looks at Design in computing, including OO design and algorithm design. In the first half of 2010 Richard's lectures for this course were also be recorded and will be posted next.
46 Lectures
-
-
Second lecture of COMP1927 Algorithms and Data Structures, which is the second course taken by first year computing students at UNSW. This course follows immediately on from COMP1917.
-
Lecture 3 of COMP1927 "Data Structures and Algorithms" by Richard Buckland UNSW, 2009
-
Lecture 4 of comp 1927 data structures and algorithms
-
Counting execution steps, big oh, complexity classes, a priori estimation. Exponential growth, big numbers, estimation, huge ants. Emergence. Lecture 5 of comp 1927 data structures and algorithms.
-
Data Structures and Algorithms - Richard Buckland
-
Lecture 7 of comp 1927
-
Comp1927 lecture 8 data structures and algorithms richard buckland needs to do some exercise
-
Comp1927 data structures and algorithms
-
Breaking the shannon limit - bucket sort, counting sort. first half of lecture 10 comp1927: data structures and algorithms
-
Second half of lecture 10, COMP1927 Data structures and Algorithms.
-
Lecture 11 comp1927 - radix sort, discussion of task 1, review of bucket sort.
-
Lecture 12 of comp1927 "Data Structures and Algorithms" Richard Buckland UNSW. This marks the end of week 3, sorting, and the release of Task 1.
-
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)
-
Second half of lecture 13 of comp1927 Data Structures and Algorithms.
-
Lecture 14 of comp1927 data structures and algorithms
-
Lecture 15 of COMP1927 "Computing 2 - Data Structures and Algorithms" the second semester course taken by first year undergraduates (computer scientists, computer engineers, software engineers, bioinformatic engineers) at UNSW
-
Lecture 16 of Comp1929 Data Structures and Algorithms by Richard Buckland at UNSW 2009.
-
Lecture 17 of comp1927 - data structures and algorithms
-
Lecture 18 of comp1927 data structures and algorithms at the University of New South Wales (UNSW)
-
We start looking at the problem of searching. Lecture 19 of COMP1927 "Data Structures and Algorithms" by Richard Buckland UNSW, 2009
-
Introduction to Searching (part II). Lectures 21-50 have been recorded and will be posted commencing July 2010. (see my comment below) The first few minutes of the video are the last few minutes of the break where we have been discussing task 2 - which will be a searching task. This is lecture 20 of COMP1927 "Data Structures and Algorithms" by Richard Buckland UNSW.
-
This is lecture 21 of COMP1927 "Data Structures and Algorithms" by Richard Buckland UNSW.
-
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
-
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.
-
-
-
-
A fish, that cannot dance a minuet, is contemptible. Sound patchy until 2:30
-
-
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.
-
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).
-
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.
-
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.
-
This is an extension lecture for interested students - nothing examinable, it's just for fun. Lecture 32 "Computing 2" Comp1927
-
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.
-
Lecture 33 of Computing2 - Data Structures and Algorithms. In this lecture we ask "How can we know if Prim's MST algorithm is correct?"
-
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
-
Introduction to numerical algorithms Lecture 34 comp1927 "computing2"
-
This is the first part of Lecture 35 in Computing2: The Science of Computer Science aka Comp1927 Data Structures and Algorithms.
-
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!
-
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.
-
An extension lecture. Just for fun. Not examinable. Directors cut: Now with the protocol movie clip at the end
-
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.
-
-
This is a fragment of an interview with Scientist and former comp1927 student Glen Kelley in which he talks about how they do things in the "real" sciences like biology and physics, and reflects on computing as a science. Recorded to help students think about their approach to task 1 in COMP1927 and shown in class in week 3 session 2 2009.