1
CS2: Data Structures and Algorithms (UNSW). Instructor: Richard Buckland.
FREE
This course includes
Hours of videos
1027 years, 8 months
Units & Quizzes
37
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
This is a collection of the 2009 lectures of COMP 1927 Algorithms and Data Structures, which is the second computing course taken by first year computing students at UNSW (University of New South Wales). This course follows immediately on from COMP1917 and provides an introduction to data structures and algorithms.
Course Currilcum
- Lecture 01 – Introduction Unlimited
- Lecture 02 – Data Structures and Algorithms Unlimited
- Lecture 03 – Data Structures and Algorithms Unlimited
- Lecture 04 – Data Structures and Algorithms Unlimited
- Lecture 05 – Data Structures and Algorithms Unlimited
- Lecture 06 – Data Structures and Algorithms Unlimited
- Lecture 07 – Data Structures and Algorithms Unlimited
- Lecture 08 – Data Structures and Algorithms Unlimited
- Lecture 09 – Data Structures and Algorithms Unlimited
- Lecture 10 – Bucket Sort, Counting Sort, Exponential Growth Unlimited
- Lecture 11 – Data Structures and Algorithms Unlimited
- Lecture 12 – Data Structures and Algorithms Unlimited
- Lecture 13 – Data Structures and Algorithms Unlimited
- Lecture 14 – Data Structures and Algorithms Unlimited
- Lecture 15 – Data Structures and Algorithms Unlimited
- Lecture 16 – Data Structures and Algorithms Unlimited
- Lecture 17 – Data Structures and Algorithms Unlimited
- Lecture 18 – Data Structures and Algorithms Unlimited
- Lecture 19 – Data Structures and Algorithms Unlimited
- Lecture 20 – Data Structures and Algorithms Unlimited
- Lecture 21 – Search Design Unlimited
- Lecture 22 – Inside and Outside Unlimited
- Lecture 23 – Hash Tables Unlimited
- Lecture 24 – Task 2 Unlimited
- Lecture 25 – Hashing Unlimited
- Lecture 26 – Loops Unlimited
- Lecture 27 – Introduction to Graphs Unlimited
- Lecture 29 – Design and Discovery Unlimited
- Lecture 30 – About the Project: Fury of Dracula Unlimited
- Lecture 32 – What is Life? The Amazing R.H. Conway Unlimited
- Lecture 33 – Graph Algorithms and Skepticism Unlimited
- Lecture 34 – Controlling Errors, Numerical Algorithms I Unlimited
- Lecture 35 – The loneliest number, Numerical Algorithms II Unlimited
- Lecture 36 – Puzzles and Protocols (with Movie) Unlimited
- Lecture 37 – Balancing Unlimited
- Lecture 38 – Balanced Trees Unlimited
- Lecture 39 – Things Go Wrong, Heaps Unlimited
