Description
Data Structures and Algorithms Specialization data building training course Algorithm It is in programming. In this tutorial, you will come across more than 100 different algorithms to solve computing problems and programming challenges, and learning each of them will increase your ability to solve these challenges. People who are engaged in the programming profession always face many problems and challenges in solving programming problems. For example, suppose you want to write a program that shows the shortest path between two points; There are many algorithms to solve this program, but finding an algorithm that is shorter, faster and more reliable is not an easy task.
This course designs many challenges and puts you on the path to solving them so that you can learn different algorithms well. First, you will be taught algorithmic thinking and the use of simple algorithms. Then more serious challenges and issues that happen in real work are examined. Also, this training includes two real challenges in the form of two projects: large networks and genome reconstruction. In the Big Networks project, you will learn how to analyze road networks and social networks and calculate the shortest path between New York and San Francisco (1000 times faster than standard shortest path algorithms). Also, in the genome reconstruction project, you will learn how to reconstruct a genome from millions of short segments of DNA.
What do you learn:
- Applying basic algorithms such as binary search, sorting, dynamic programming, etc
- Apply professional algorithms such as graph and string to solve real challenges: finding the shortest path and reconstructing the genome
- Apply different types of data structures such as stack, queue, hash table, binary search tree and graph
- Solving complex programming problems with advanced techniques such as linear programming, estimator algorithms, etc
Specifications of Data Structures and Algorithms Specialization:
- Publisher: Coursera
- Lecturer: Alexander S. Kulikov, Michael Levin Neil Rhodes, Pavel Pevzner, Daniel M Kane
- English language
- Education level: Intermediate
- Number: 6 courses
- Duration of the course: with a suggested time of 6 hours per week, approximately 8 months
courses
prerequisites
- 1. Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala. We expect you to be able to implement programs that: 1) read data from the standard input (in most cases, the input is a sequence of integers); 2) compute the result (in most cases, a few loops are enough for this); 3) print the result to the standard output. For each programming challenge in this course, we provide starter solutions in C++, Java, and Python. The best way to check whether your programming skills are enough to go through problems in this specialization is to solve two problems from the first week. If you are able to pass them (after reading our tutorials), then you will definitely be able to pass the course.
- 2. Basic knowledge of discrete mathematics: proof by induction, proof by contradiction. Knowledge of discrete mathematics is necessary for analyzing algorithms (proving correctness, estimating running time) and for algorithmic thinking in general. If you want to refresh your discrete mathematics skills, we encourage you to go through our partner specialization — Introduction to Discrete Mathematics for Computer Science (https://www.coursera.org/specializations/discrete-mathematics). It teaches the basics of discrete mathematics in try-this-before-we-explain-everything approach: you will be solving many interactive puzzles that were carefully designed to allow you to invent many of the important ideas and concepts yourself
Pictures
Sample video
Installation guide
After extracting, watch with your favorite player.
English subtitle
Quality: 720p
This collection includes 6 different courses.
Some assignments and course codes: Link 1 ; Link 2
Changes:
In version 2022/12, some of the trainings of the previous version have been removed and new trainings have been added. Reading files have also been added to the course.
Version 2023/12 compared to 2022/12: the number of 2 videos for a duration of 13 minutes has increased and about 100 text files have been added.
download link
Course 1 – Algorithmic Toolbox
Course 2 – Data Structures
Course 3 – Algorithms on Graphs
Course 4 – Algorithms on Strings
Course 5 – Advanced Algorithms and Complexity
Course 6 – Genome Assembly Programming Challenge
Password file(s): www.downloadly.ir
Size
6.5 GB
Be the first to comment