![UHMICSAlgorithms](/img/default-banner.jpg)
- 72
- 680 885
UHMICSAlgorithms
Приєднався 5 вер 2013
I recorded these videos in the fall of 2013 as one component of "inverting" our ICS 311 Algorithms course. The video lectures are based on CLRS (Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein, MIT Press, 3rd edition). Students have the option of reading the text, viewing these videos, and/or reading my web based lecture notes before class. Class starts with a quiz that tests comprehension of basic concepts in the lectures, but most of the class consists of problem solving in small groups on problems intended to further develop understanding of the algorithms. The videos were intentionally recorded in low resolution to keep them small. The first weeks have some audio problems until I got a Yeti microphone. -- Dan Suthers, Professor of Computer Science, Information and Computer Sciences, University of Hawaii (see www.ics.hawaii.edu/people/ for contact information; I do not read email for this UA-cam account).
Topic 02 A Insertion Sort
Topic 02 A: Insertion Sort
Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class. This was one of the first videos recorded and there are quality problems I figured out later.)
Based on Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, Third Edition, The MIT Press, 2009.
Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class. This was one of the first videos recorded and there are quality problems I figured out later.)
Based on Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, Third Edition, The MIT Press, 2009.
Переглядів: 2 144
Відео
Topic 02 B Loop Invariant of Insertion Sort
Переглядів 3,3 тис.Рік тому
Topic 02 B: Loop Invariants of Insertion Sort Lecture by Dan Suthers suthers@hawaii.edu for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class. This was one of the first videos recorded and there are quality problems I figured out later.) Based on Thomas H. Cormen, Charles E. Leiserson, Ronald L. Ri...
Topic 02 C Detailed Analysis of Insertion Sort
Переглядів 1,7 тис.Рік тому
Topic 02 C: Detailed Analysis of Insertion Sort Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class. This was one of the first videos recorded and there are quality problems I figured out later.) Based on Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford...
Topic 02 D Merge Sort
Переглядів 1,6 тис.Рік тому
Topic 02 D: Merge Sort Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class. This was one of the first videos recorded and there are quality problems I figured out later.) Based on Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to A...
Topic 02 E Analysis of Merge Sort
Переглядів 1,9 тис.Рік тому
Topic 02 E: Analysis of Merge Sort Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class. This was one of the first videos recorded and there are quality problems I figured out later.) Based on Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Intro...
Topic 20 B Residuals Augmenting Flows
Переглядів 6 тис.10 років тому
Topic 20 B: Residual, Augmenting, Min/Max Residual graphs, augmenting flows, and the min cut max flow theorem. More on Midway island. Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class.) Based on Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, ...
Topic 20 C Flow Algorithms Applications
Переглядів 6 тис.10 років тому
Topic 20 C: Flow Algorithms and Application Ford-Fulkerson, Edmonds-Karp and Bipartite Matching. More on Midway island. Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class.) Based on Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction t...
Topic 20 A Maximum Flow Intro
Переглядів 7 тис.10 років тому
Topic 20 A: Introduction to Maximum Flow Problem Introduces flow networks and the maximum flow problem. Supplies some background in graph theory concerning cuts. We also stop on Midway island for this series of screencasts. Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in clas...
Topic 19 C Floyd Warshall
Переглядів 9 тис.10 років тому
Topic 19 C: Floyd-Warshall all pairs shortest paths algorithm Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class.) Based on Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, Third Edition, The MIT Press, 2009.
Topic 19 B Johnsons Algorithm
Переглядів 12 тис.10 років тому
Topic 19 B: Johnson's Algorithm for All Pairs Shortest Paths. Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class.) Based on Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, Third Edition, The MIT Press, 2009.
Topic 19 A All Pairs Shortest Paths
Переглядів 12 тис.10 років тому
Topic 19 A: All Pairs Shortest Paths Introduction. Also a visit to Pearl & Hermes Atoll. Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class.) Based on Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, Third Edition, Th...
Java Interface Demo
Переглядів 29010 років тому
Demonstration by Anthony Sarria, recorded for University of Hawaii Information and Computer Sciences course 311 on Algorithms.
Topic 15 B Dynamic Table Analysis
Переглядів 9 тис.10 років тому
Topic 15 B: Aggregate Analysis of Dynamic Tables; Other examples to which amortized analysis applies. Images from Tern Island in the French Frigate Shoals: A dynamic island shaped like a table! Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class.) Based on Thomas H. Cormen,...
Topic 15 A Amortized Analysis
Переглядів 9 тис.10 років тому
Topic 15 A: Introduction to Amortized Analysis, including Aggregate, Accounting, and Potential methods. Images from La Perouse in the French Frigate Shoals. Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class.) Based on Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rive...
Topic 14 C BFS
Переглядів 6 тис.10 років тому
Topic 14 C: Overview of Depth-First and Breadth-First Search; Closer examination of Breadth-First Search and its application to finding shortest paths; Complexity analysis. More images of Nihoa. Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class.) Based on Thomas H. Cormen...
Topic 12 D DP Applications Summary
Переглядів 3,6 тис.10 років тому
Topic 12 D DP Applications Summary
Topic 12 A Dynamic Programming Intro
Переглядів 37 тис.10 років тому
Topic 12 A Dynamic Programming Intro
Topic 08 B Binary Search Tree Queries
Переглядів 3,1 тис.10 років тому
Topic 08 B Binary Search Tree Queries
Topic 08 A Trees, Binary Trees, and basic quantitative facts
Переглядів 2,7 тис.10 років тому
Topic 08 A Trees, Binary Trees, and basic quantitative facts
Topic 25 B Approximation Strategies
Переглядів 5 тис.10 років тому
Topic 25 B Approximation Strategies
Topic 25 A Approximation Algorithms
Переглядів 73 тис.10 років тому
Topic 25 A Approximation Algorithms
I think it is < instead of <= for small o and small w notations between f(n) and c(g(n)). But thanks for the videos. They are really helpful as the book is quite difficult to comprehend. At least up to this part.
Web notes?
You explained this for just about anyone to understand. A good professor is hard to find. Thanks for these videos.
thanks for the lecture series. can you post the exercises and problem set as well?
Where do we go for the solutions? Whats the link?
You should really strikethrough your zeroes when working with 0s and Os. Makes the video quite confusing.
But then you have theta.
6 years after introduction to algorithms, I have finally understood asymptotic notations
ya very nice explanation indeed.
Bc.. Baap video banaya hai.. thanks matey
great explanations
I think there is a slight mistake in your definition of monotone decreasing function and strictly decreasing
thanks for the video , very well explained just a small mistake the definition is exactly less < : o(g(n)) = { f (n) : for any positive constant c > 0, there exists a constant n0 > 0 such that 0 ≤ f (n) < cg(n) for all n ≥ n0} . for omega : ω(g(n)) = { f (n) : for any positive constant c > 0, there exists a constant n0 > 0 such that 0 ≤ cg(n) < f (n) for all n ≥ n0}
Thanks uploader these are very useful videos they are so much more clear than my textbook.
great work really thanks alot sir
Thanks for an excellent series of lectures! I've learned so much because you know how to teach this material. Plus I now want to hike Hawaii.
In your explanation (6:25) you say that for little o n^2 not equal to n^2 and for little omega n^2 not equal to n^2. But in your definition just above you wrote less than or equal too. Which is correct?
It's infuriating how some professors will cling to the formal definition without illustrating the analogous meaning of each function. I feel this is a very poorly designed notation if only because each function is named so arbitrarily. Thank you for the simple answer I was looking for.
Ehh, it's pretty standard in math for the first function to be named f(n) and second named g(n), but I understand what you mean. Though It's important to know the formal definition because you use it in proofs, but the conceptual explanation is definitely more important. Alot of Math and CS professors are brilliant but bad teachers. It's just part of the game.
thank you
nice videos! Whats the graphing calculator you are using?
"Grapher"
Thanks, the video was useful.
Thanks helped me figure out the assumption step. I would recommend writing more clearer because i found it hard to fully see what you were writing. Explained very clearly though
that was one amazing lecture :)
thanks for the clear detailed explanation. This really elucidates the dense writing in my book
best explanation on LCS. Thank u
Sir, it's the best video on DAC , you explore the every expect on this algorithm thank alot.
You mean h2(k) relatively prime to m, right?
wow, thanks! and great example :D. I wish my university had also this good study materials...