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. You'll learn the divide-and-conquer design paradigm, with applications to fast sorting, searching, and multiplication. You'll learn several blazingly fast primitives for computing on graphs, such as how to compute connectivity information and shortest paths. Finally, we'll study how allowing the computer to "flip coins" can lead to elegant and practical algorithms and data structures. Learn the answers to questions such as: How do data structures like heaps, hash tables, bloom filters, and balanced search trees actually work, anyway? How come QuickSort runs so fast? What can graph algorithms tell us about the structure of the Web and social networks? Did my 3rd-grade teacher explain only a suboptimal algorithm for multiplying two numbers?**Will I get a statement of accomplishment after completing this class?**Yes. Students who successfully complete the class will receive a statement of accomplishment signed by the instructor.

**What is the format of the class?**The class consists of lecture videos, which are broken into small chunks, usually between eight and twelve minutes each. Some of these may contain integrated quiz questions. There will also be standalone quizzes that are not part of video lectures. There will be approximately two hours worth of video content per week.

**What should I know to take this class?**How to program in at least one programming language (like C, Java, or Python); familiarity with proofs, including proofs by induction and by contradiction; and some discrete probability, like how to compute the probability that a poker hand is a full house. At Stanford, a version of this course is taken by sophomore, junior, and senior-level computer science majors.

Dates:

- 5 October 2015, 6 weeks
- 29 June 2015, 6 weeks
- 19 January 2015, 6 weeks
- 13 October 2014, 6 weeks
- 28 April 2014, 6 weeks
- 1 July 2013, 6 weeks
- 28 January 2013, 6 weeks
- 11 June 2012, 6 weeks
- 12 March 2012, 5 weeks

Included in selections:

Algorithms

Algorithms and data structures from the beginning to advanced analysis.

Algorithms and data structures from the beginning to advanced analysis.

Network Science

Networks, graphs etc.

Networks, graphs etc.

Алгоритмизация вычислений

1 курс МИЭМ ВШЭ, 4 кредита

1 курс МИЭМ ВШЭ, 4 кредита

More on this topic:

Intro to Parallel Programming. Using CUDA to Harness the Power of GPUs

Learn the fundamentals of parallel computing with the GPU and the CUDA programming...

Learn the fundamentals of parallel computing with the GPU and the CUDA programming...

Data Structures and Algorithms

This is a rigorous course on the design and analysis of efficient algorithms...

This is a rigorous course on the design and analysis of efficient algorithms...

Algorithmic Thinking

Experienced Computer Scientists analyze and solve computational problems at...

Experienced Computer Scientists analyze and solve computational problems at...

Introduction to Data Structures & Algorithms in Java

Designed to help understand the fundamentals of DS & Algorithms really well...

Designed to help understand the fundamentals of DS & Algorithms really well...

Quantum Complexity Theory

This course is an introduction to quantum computational complexity theory, the...

This course is an introduction to quantum computational complexity theory, the...

More from 'Computer Science':

UX Research

In this MOOC you will learn how to connect with users at every step of a digital...

In this MOOC you will learn how to connect with users at every step of a digital...

UX Prototyping

Become a prototyping virtuoso! Master the ability to propel your creative team...

Become a prototyping virtuoso! Master the ability to propel your creative team...

UX Data Analysis

Become a UX data scientist! From qualitative data analysis to big data Web analytics...

Become a UX data scientist! From qualitative data analysis to big data Web analytics...

UX Management

Be a UX advocate! Lead the gamut of user-centered design activities, while sharing...

Be a UX advocate! Lead the gamut of user-centered design activities, while sharing...

Google's Python Class

Welcome to Google's Python Class -- this is a free class for people with a little...

Welcome to Google's Python Class -- this is a free class for people with a little...

More from 'Coursera':

First Year Teaching (Secondary Grades) - Success from the Start

Success with your students starts on Day 1. Learn from NTC's 25 years developing...

Success with your students starts on Day 1. Learn from NTC's 25 years developing...

Understanding 9/11: Why Did al Qai’da Attack America?

This course will explore the forces that led to the 9/11 attacks and the policies...

This course will explore the forces that led to the 9/11 attacks and the policies...

Aboriginal Worldviews and Education

This course will explore indigenous ways of knowing and how this knowledge can...

This course will explore indigenous ways of knowing and how this knowledge can...

Analytic Combinatorics

Analytic Combinatorics teaches a calculus that enables precise quantitative...

Analytic Combinatorics teaches a calculus that enables precise quantitative...

Accountable Talk®: Conversation that Works

Designed for teachers and learners in every setting - in school and out, in...

Designed for teachers and learners in every setting - in school and out, in...

© 2013-2019