Algorithms Part II – Coursera – Free software download

Algorithms Part II

Description

Algorithms, Part II, continued The first part of the series of training and familiarization with algorithms and data structures is. In this course, important topics that every serious programmer should know about algorithms and data structures with a focus on software and Java implementation scientific performance analysis are taught. The first part of this series covered elementary data structure, classification and search algorithms, and now in this part we cover graph- and string- processing algorithms.

Skills you will learn in the Algorithms, Part II course:

  • Graphs
  • Data structure
  • Algorithms
  • Data Compression

Course details:

  • Publisher: Coursera
  • teacher: Kevin Wayne, Robert Sedgewick
  • English language
  • Education level: Intermediate
  • Number of courses: 66
  • Duration: 16 hours and 41 minutes

Course headings

Week 1

Introduction – 9m

Undirected Graphs – 98m

Directed Graphs – 68m

Week 2

Minimum Spanning Trees – 85m

Shortest Paths – 85m

Week 3

Maximum Flow and Minimum Cut – 72m

Radix Sorts – 85m

Week 4

Tries – 75m

Substring Search – 75m

Week 5

Regular Expressions – 83m

Data Compression – 80m

Week 6

Reductions – 40m

Linear Programming (optional) – 61m

Intractability – 85m

Course prerequisites:

Our central thesis is that algorithms are best understood by implementing and testing them. Our use of Java is essentially expository, and we shy away from exotic language features, so we expect you would be able to adapt our code to your favorite language. However, we require that you submit the programming assignments in Java.

Pictures

Sample video

Installation guide

After extracting, watch with your favorite player.

Subtitle: English and…

Quality: 720p

download link

Download part 1 – 1 GB

Download part 2 – 1 GB

Download part 3 – 52 MB

Password file(s): www.downloadly.ir

Size

2 GB

4.7/5 – (3134 points)

Be the first to comment

Leave a Reply

Your email address will not be published.


*