explanation
Algorithms Specialization is the name of a training set for like-minded scientists and the computer science industry and with the help of this course you will acquire the basic principles of algorithm design and analysis techniques. Algorithms are at the heart of computer science, and this problem has practical applicability across numerous industries. During this collection, a preliminary introduction to algorithms was provided for students with some programming experience. Although this course is a relatively challenging industry, it emphasized an overview and conceptual understanding of low-level minor math implementations. By the end of this course, you will have reached the level you want to achieve in interviews with other programmers and scientists on Computer Science Talk: technical supremacy of the mind, and spiritualism over algorithms.
The skills available from the Algorithm specialization set include:
- algorithm
- dynamic programming
- Algorithm Greedy
- Algorithm divide and conquer
- Algorithm random storage
- sorting algorithm
- graph
- data structure
- hash table
- the next graph in the graph
- Np-completeness
Specification Volume:
Publisher: Coursera
teacher: Team Rough Garden
Language: English,
Education level: average
Number of courses: 4
Time: 2 months, 10 hours a week
Courses available in the Algorithms Specialty Collection:
precondition:
Learners must know how to program in at least one programming language (such as C, Java, or Python). Some knowledge of proof, including proof by induction and contradiction; And there are also some discrete probabilities, such as how to calculate the probability of a poker hand being full. At Stanford, sophomore, junior, and senior computer science majors take this course.
image
sample video
installation manual
After extracting, use the back player to select the desired view.
Subtitles: English and other languages
Quality: 720
There is no change in the number or period of lessons compared to the 2021/2 version in the 2024/3 version, but 219 text files have been added.
This set consists of four industry courses:
download link
Divide and conquer, sort and search, randomization algorithms
Graph search, shortest path, and data structures
Greedy Algorithm, Minimum Spanning Tree, and Dynamic Programming
Shortest path revisited, NP-complete problem and what to do about it
Password file: free download software
file size
3.9GB