Featured Channels
Subscription preferences
UNSWelearning
CS2: Data Structures and Algorithms - Richard Buckland
-
1
Lecture 1: Introduction to Data Structures and Algorithms - Richard Buckland
by UNSWelearning 145,626 views
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). -
2
Lecture 2: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 49,635 views
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.
-
3
Lecture 3: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 37,037 views
Lecture 3 of COMP1927 "Data Structures and Algorithms" by Richard Buckland UNSW, 2009
-
4
Lecture 4: data structures and algorithms - Richard Buckland
by UNSWelearning 29,395 views
Lecture 4 of comp 1927 data structures and algorithms
-
5
Lecture 5: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 29,187 views
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. -
6
Lecture 6: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 18,441 views
Data Structures and Algorithms - Richard Buckland
-
7
Lecture 7: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 15,431 views
lecture 7 of comp 1927
-
8
Lecture 8: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 14,791 views
comp1927 lecture 8 data structures and algorithms richard buckland needs to do some exercise
-
9
Lecture 9: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 13,766 views
comp1927 data structures and algorithms
-
10
Lecture 10a: Bucket Sort, Counting Sort - Richard Buckland
by UNSWelearning 32,265 views
breaking the shannon limit - bucket sort, counting sort. first half of lecture 10 comp1927: data structures and algorithms
-
11
Lecture 10b: Exponential Growth - Richard Buckland
by UNSWelearning 7,404 views
Second half of lecture 10, COMP1927 Data structures and Algorithms.
-
12
Lecture11: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 10,979 views
lecture 11 comp1927 - radix sort, discussion of task 1, review of bucket sort.
-
13
a priori VS a posteriori: Interview with Glen Kelley
by UNSWelearning 3,540 views
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.
-
14
Lecture12: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 11,178 views
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.
-
15
Lecture13a: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 6,714 views
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) -
16
Lecture13b: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 5,421 views
Second half of lecture 13 of comp1927 Data Structures and Algorithms.
-
17
Lecture14: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 7,671 views
Lecture 14 of comp1927 data structures and algorithms
-
18
Lecture15: Data Structures and Algorithms - Richard Buckland, UNSW
by UNSWelearning 9,851 views
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
-
19
Lecture 16: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 7,262 views
Lecture 16 of Comp1929 Data Structures and Algorithms by Richard Buckland at UNSW 2009.
-
20
Lecture 17: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 7,001 views
lecture 17 of comp1927 - data structures and algorithms
-
21
Lecture 18: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 7,893 views
lecture 18 of comp1927 data structures and algorithms at the university of new south wales (UNSW)
-
22
Lecture 19: Data Structures and Algorithms - Richard Buckland
by UNSWelearning 10,515 views
we start looking at the problem of searching. Lecture 19 of COMP1927 "Data Structures and Algorithms" by Richard Buckland UNSW, 2009
-
23
Lecture 20: Data Structures and Algorithms - RIchard Buckland UNSW
by UNSWelearning 20,667 views
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. -
24
Lecture 21: Search Design - Richard Buckland Computing2 UNSW
by UNSWelearning 7,335 views
This is lecture 21 of COMP1927 "Data Structures and Algorithms" by Richard Buckland UNSW.
-
25
Lecture 22: Inside and Outside - Richard Buckland UNSW - Computing2
by UNSWelearning 4,160 views
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 -
26
Lecture 23: Hash Tables - Richard Buckland UNSW Computing2
by UNSWelearning 21,689 views
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. -
30
27: Introduction to Graphs - Richard Buckland UNSW
by UNSWelearning 9,221 views
A fish, that cannot dance a minuet, is contemptible. Sound patchy until 2:30
-
32
About the Project: Fury of Dracula - Richard Buckland
by UNSWelearning 2,412 views
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. -
33
31: Simple Graph Problems - Richard Buckland UNSW
by UNSWelearning 3,603 views
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).
-
34
Linked List ADT in C 2/2 - Richard Buckland UNSW
by UNSWelearning 1,860 views
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. -
35
Linked List ADT in C 1/2 - Richard Buckland UNSW
by UNSWelearning 2,866 views
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. -
36
32: What is Life? The Amazing R.H. Conway - Richard Buckland UNSW
by UNSWelearning 3,987 views
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.) -
37
33a: admin only - Richard Buckland UNSW
by UNSWelearning 1,092 views
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. -
38
33b: Graph Algorithms and Skepticism - Richard Buckland, UNSW
by UNSWelearning 3,621 views
Lecture 33 of Computing2 - Data Structures and Algorithms. In this lecture we ask "How can we know if Prim's MST algorithm is correct?"
-
39
34a: Controlling Errors - Richard Buckland, UNSW
by UNSWelearning 1,211 views
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
-
40
34b: Numerical Algorithms I - Richard Buckland UNSW
by UNSWelearning 3,228 views
Introduction to numerical algorithms
Lecture 34 comp1927 "computing2" -
41
35a: The loneliest number - Richard Buckland UNSW
by UNSWelearning 2,039 views
This is the first part of Lecture 35 in Computing2: The Science of Computer Science aka Comp1927 Data Structures and Algorithms.
-
42
35b: Numerical Algorithms II - Richard Buckland UNSW
by UNSWelearning 2,218 views
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! -
43
not a lecture: just chitchat about the project and misc before extension lecture 36
by UNSWelearning 817 views
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.
-
44
36: Puzzles and Protocols (with Movie) - Richard Buckland UNSW
by UNSWelearning 1,311 views
An extension lecture. Just for fun. Not examinable.
Directors cut: Now with the protocol movie clip at the end
(jump to 17:35) -
45
37: Balancing - Richard Buckland UNSW
by UNSWelearning 2,352 views
Comp1927 lecture 37 Balance. Implications of balanced and unbalanced tress. Also Teamwork. Blame. Complaining.
-
46
38: Balanced Trees - Richard Buckland UNSW
by UNSWelearning 5,168 views
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.
