1

Step 1

Week 1

2

Step 2

Week2

3

Step 3

Week3

4

Step 4

Week 4

5

Step 5

Week 5

6

Step 6

Week 6

7

Step 7

Week 7

1

Step 1

Week 1

2

Step 2

Week2

3

Step 3

Week3

4

Step 4

Week 4

5

Step 5

Week 5

6

Step 6

Week 6

7

Step 7

Week 7

20 September 2016 27 November 2016
The goal is overdue by 2728 days

Goal abandoned

The author does not write in the goal 7 years 7 months 17 days

Career & Work

Finish Stanford's course Algorithms: Design and Analysis, Part I

:earn more about algorithms

 Goal Accomplishment Criteria

Got a certificate

 Personal resources

time

  1. Week 1

    1. Introduction

    2. Asymptotic Analysis

    3. Divide & Conquer

    4. Problem Set #1

    5. Programming Assignment #1

  2. Week2

    1. The Master Method

    2. QuickSort - Algorithm

    3. QuickSort - Analysis

    4. Probablility Rreview

    5. Problem Set #2

    6. Programming Assignment #2

  3. Week3

    1. Linear-time selection

    2. Graphs and Contraction Algorithm

    3. Problem Set #3

    4. Programming Assingment #3

  4. Week 4

    1. Graphs Search and Connectivity

    2. Problem Set #4

    3. Programming Assingment #4

  5. Week 5

    1. Dijkstra's Shortest-Path Algorithm

    2. Heaps

    3. Balanced Binary Search Trees

    4. Problem Set #5

    5. Programming Assingment #5

  6. Week 6

    1. Hashing: The Basics

    2. Universal Hashing

    3. Bloom Filters

    4. Preview of Part II

    5. Problem Set #6

    6. Programming Assingment #6

  7. Week 7

    1. Final Exam

  • 893
  • 20 September 2016, 18:25
Sign up

Signup

Уже зарегистрированы?
Quick sign-up through social networks.
Sign in

Sign in.
Allowed.

Not registered yet?
 
Log in through social networks
Forgot your password?