explanation
Algorithms, Part II., continued The first part of a collection of training and knowledge about algorithms and data structures am. In the course of important topics about algorithms and data structures that every programmer must seriously consider, education is focused on the application and analysis of academic achievements that executives need to know. In the first part of this series, we will classify and search algorithms that deal with the basic structure of data, alliances, and now in this part of the algorithm we will deal with processing graphs and strings.
The skills learned in Algorithm Part 2 are as follows.
- graph
- data structure
- algorithm
- data compression
Specification Volume:
- Publisher: Coursera
- teacher: kevin wayne, Robert Sedgwick
- Language:English
- Training level: Intermediate
- Number of courses: 66
- Duration: 16 hours 41 minutes
this process
Week 1
Introduction – 9 minutes
Undirected Graph – 98m
Directed Graph – 68m
Week 2
Minimum Spanning Tree – 85m
Shortest path – 85m
Week 3
Maximum flow and minimum cut – 72m
Nose alignment – 85m
Week 4
Attempt – 75m
Substring search – 75m
Week 5
Regular Expressions – 83 minutes
Data Compression – 80m
Week 6
Decrease – 40m
Linear Programming (Optional) – 61 minutes
Difficult – 85m
precondition:
Our central theme is that algorithms are best understood by implementing and testing them. The use of Java is descriptive in nature and avoids exotic language features, so we expect you to be able to adapt the code to your preferred language. However, programming assignments must be submitted in Java.
image
sample video
installation manual
Extract it and enjoy it with the player of your choice.
Subtitles: English…
Quality: 720p
download link
Password file: free download software
file size
2GB