Coursera – Data Structures and Algorithms Specialization 2020-8

Description

Data Structures and Algorithms Specialization is a training course on data structure and algorithms in programming. In this tutorial, you will encounter more than 100 different algorithms for solving computational problems and programming challenges, learning each of which will increase your ability to solve these challenges. People who work 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 several algorithms to solve this program, but finding an algorithm that is shorter, faster and more reliable is not an easy task.

This course designs several 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 the more serious challenges and issues that occur in real work are examined. The training also includes two real challenges in the form of two projects: large networks and genome reconstruction. In the Large Networks Project, you learn what algorithms to use to analyze road networks and social networks and calculate the shortest route between New York and San Francisco (1000 times faster than standard shortest route algorithms). Also in the genome reconstruction project, you learn how to reconstruct a genome from millions of short sections of DNA.

What do you learn?

Apply basic algorithms such as binary search, sorting, dynamic programming, etc.

Apply professional algorithms such as graphs and strings to solve real challenges: find the shortest path and reconstruct the genome

Apply different types of data structures such as stack, queue, hash table, binary search tree and graph

Solve complex programming problems with advanced techniques such as linear programming, estimating algorithms, etc.

Specifications of Data Structures and Algorithms Specialization

Publisher: Coursera

Instructors: Alexander S. Kulikov, Michael Levin, Neil Rhodes, Pavel Pevzner, Daniel M Kane

English language

Level of education: Intermediate

Number: 6 courses

Duration of the course: with a suggested time of 6 hours per week, approximately 8 months

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 yoursel

Installation

After Extract, watch with your favorite Player.

English subtitle

Quality: 720p