Published on: 2021-02-10 19:34:22
Categories: 28
Share:
Algorithms, Part II., the continuation of the first part of the collection of training and familiarity with the algorithms and the structure of the data is. In the course of important topics that every programmer serious should be about algorithms and data structures, with a focus on application and analysis of academic performance of the executive’s gonna know, education is given. The first part of this series, the basic structure of the data , classify and Algorithms search covering the alliance, and now, in this part of the algorithm, the processing graph – and string – make a cover we.
Week 1
Introduction – 9m
Undirected Graphs– 98m
Directed Graphs – 68m
Week 2
Minimum Spanning Trees – 85m
Shortest Paths – 85m
Week 3
Maximum Flow and Minimum Cut – 72m
Radix Sorts – 85m
Week 4
Tries – 75m
Substring Search – 75m
Week 5
Regular Expressions – 83m
Data Compression – 80m
Week 6
Reductions – 40m
Linear Programming (optional) – 61m
Intractability – 85m
Our central thesis is that algorithms are best understood by implementing and testing them. Our use of Java is essentially expository, and we shy away from exotic language features, so we expect you would be able to adapt our code to your favorite language. However, we require that you submit the programming assignments in Java.
After the Extract, watch it with the Player you like.
Subtitle: English ….
Quality: 720p
2 GB
Sharing is caring: