Selection: FutureBiotech: Programming

Author: Grigory Sapunov
Course
Description
Dates
1
Small-icon.hover
Small-icon.hover
Tim Roughgarden
Stanford University
Computer Science
Gb Free
Course added: long ago
In this course you will learn several fundamental principles of algorithm design: divide-and-conquer methods, graph algorithms, practical data structures (heaps, hash tables, search trees), randomized algorithms, and more. In this course you will learn several fundamental principles of algorithm design...
5 October 2015, 6 weeks
Favored by 4 people
2
Small-icon.hover
Small-icon.hover
Tim Roughgarden
Stanford University
Computer Science
Gb Free
Course added: long ago
In this course you will learn several fundamental principles of advanced algorithm design: greedy algorithms and applications; dynamic programming and applications; NP-completeness and what it means for the algorithm designer; the design and analysis of heuristics; and more. In this course you will learn...
16 March 2015, 6 weeks
Favored by 4 people
3
Small-icon.hover
Small-icon.hover
Kevin Wayne and Robert Sedgewick
Princeton University
Computer Science Engineering & Technology
Gb Free
Course added: long ago
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers basic iterable data types, sorting, and searching algorithms. An introduction...
22 January 2016, 6 weeks
Favored by 12 people
4
Small-icon.hover
Small-icon.hover
Kevin Wayne and Robert Sedgewick
Princeton University
Computer Science Engineering & Technology
Gb Free
Course added: long ago
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part II covers graph-processing algorithms, including minimum spanning tree and shortest...
16 March 2016, 6 weeks
Favored by 4 people
5
Aofa-logo
Aofa-logo
This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. In addition, this course covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures...
4 March 2016, 6 weeks
Favored by 5 people
6
Ac-logo
Ac-logo
Analytic Combinatorics teaches a calculus that enables precise quantitative predictions of large combinatorial structures. This course introduces the symbolic method to derive functional relations among ordinary, exponential, and multivariate generating functions, and methods in complex analysis for...
6 November 2015, 6 weeks
Favored by 3 people
7
Discreetoptimisation_logo
Discreetoptimisation_logo
Professor Pascal Van Hentenryck
The University of Melbourne
Computer Science
Gb Free
Course added: long ago
Tired of solving Sudokus by hand? This class teaches you how to solve complex search problems with discrete optimization concepts and algorithms, including constraint programming, local search, and mixed-integer programming. Optimization technology is ubiquitous in our society. It schedules planes and...
4 March 2015, 9 weeks
Favored by 4 people

© 2013-2019