Coursera – Data Structures and Algorithms Specialization 2020-8

Description

Specialization in Data Structures and Algorithms the period of the training data structure and algorithms in programming. In this tutorial, you with over 100 different algorithms to solve the computational difficulties and programming challenges you encounter while learning each one, it’s the ability you have to solve the challenges that increases . People in the coding profession are always busy with problems and the many challenges to solve the programming problems you face. For example, suppose you wanted to program write only the shortest path between two points and show the…algorithms were used to solve this program, there are some, but find an algorithm that is shorter, faster and more reliable is no small task.

The course, many design challenges and you on the way to solve them puts you different algorithms to learn well. First, you think of an algorithm and the use of algorithms, simple, Ruth is given. Then the most serious challenges that occur in real work are investigated. Also, this Tutorial contains two real challenges in the form of two projects as well: Network and reconstruction of the genome. In Project Network, big tits, etc., you learn what the algorithm calculates, the network, the analysis of roads and social networks and the shortest route between New York and San Francisco ( 1000 times faster than the standard shortest route algorithm). Also in the genome reconstruction project, learning can scream that how a genome is made from millions of short sections of DNA remodeling.

What things to learn

Apply the algorithm of a basis, such as binary search, etc. sorting, dynamic programming, etc.
Apply for crypt professionals, such as graph and string, to solve the real challenges: finding the shortest path and genome reconstruction
Apply a variety of different data structures such as stack, queue, table, hash, etc. Binary search tree and graph
Solve complex programming problems with advanced techniques like programming, linear algorithms, etc., encoder, villain, etc.

Specifications of the Data Structures and Algorithms Specialization

Publisher: Coursera
Speaker: Alexander S. Kulikov, Michael Levin, etc. Neil Rhodes and … Pavel Pevzner, etc., Daniel M Kane
French language
Level of training: Intermediate
Total: 6 lessons
Time during the period: with a suggested time 6 hours per week, almost 8 months

Course

Algorithmic Toolbox
Data structures
Algorithms on graphs
Algorithms on strings
Advanced algorithms and complexity
Genome Assembly Programming Challenge

Preconditions

1. Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala. standard input (in most cases the input is a sequence of integers); 2) calculate the result (in most cases, a few loops are enough for this); 3) print the result to standard output. For each programming challenge in this course, we provide starter solutions in C++, Java, and Python. The best way to check if your programming skills are sufficient to solve the problems of this specialization is to solve two problems in the first week. If you are able to pass them (after reading our tutorials), then you can definitely pass the course.
2. Basic knowledge in 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 brush up on your discrete math skills, we encourage you to go through our partner specialization – Introduction to Discrete Mathematics for Computing (https://www.coursera.org/specializations/discrete-mathematics). It teaches the basics of discrete math in the try-before-explain approach: you’ll solve many interactive puzzles that have been carefully designed to let you invent many important ideas and concepts on your own.