1

Step 1

Week 1

2

Step 2

Week 2

3

Step 3

Week 3

4

Step 4

Week 4

5

Step 5

Week 5

6

Step 6

Week 6

7

Step 7

Final Exam

1

Step 1

Week 1

2

Step 2

Week 2

3

Step 3

Week 3

4

Step 4

Week 4

5

Step 5

Week 5

6

Step 6

Week 6

7

Step 7

Final Exam

15 July 2016 31 August 2016
Goal completed 20 August 2016

Goal author

FreakyGang

Russia, Чебоксары

34 years old

Education

Пройти курс "Algorithms: Design and Analysis, Part 2"

Стартовала вторая часть курса "Algorithms: Design and Analysis" от Стэнфордского университета.

Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This course is an introduction to algorithms for learners with at least a little programming experience. The course is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this course, you will have a greater mastery of algorithms than almost anyone without a graduate degree in the subject.

Specific topics in Part 2 include: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes), dynamic programming (knapsack, sequence alignment, optimal search trees, shortest paths), NP-completeness and what it means for the algorithm designer, analysis of heuristics, local search.

 Goal Accomplishment Criteria

лекции прослушаны, problem set'ы отвечены, задания решены, финальный экзамен пройден!

 Personal resources

математический склад ума

 Goal ecological compatibility

алгоритмы нужно знать, хотя бы поверхостно

  1. Week 1

    1. Watch video lessons. I. TWO MOTIVATING APPLICATIONS

    2. Watch video lessons. II. SELECTED REVIEW FROM PART I

    3. Watch video lessons. III. INTRODUCTION TO GREEDY ALGORITHMS

    4. Watch video lessons. IV. A SCHEDULING APPLICATION

    5. Watch video lessons. V. PRIM'S MINIMUM SPANNING TREE ALGORITHM

    6. Problem Set #1

    7. Programming Assignment #1

  2. Week 2

    1. Watch video lessons. VI. KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM

    2. Watch video lessons. VII. CLUSTERING

    3. Watch video lessons. VIII. ADVANCED UNION-FIND

    4. Watch video lessons. IX. HUFFMAN CODES

    5. Problem Set #2

    6. Programming Assignment #2

  3. Week 3

    1. Watch video lessons. X. INTRODUCTION TO DYNAMIC PROGRAMMING

    2. Watch video lessons. XI. THE KNAPSACK PROBLEM

    3. Watch video lessons. XII. SEQUENCE ALIGNMENT

    4. Watch video lessons. XIII. OPTIMAL BINARY SEARCH TREES

    5. Problem Set #3

    6. Programming Assignment #3

  4. Week 4

    1. Watch video lessons. XIV. THE BELLMAN-FORD ALGORITHM

    2. Watch video lessons. XV. ALL-PAIRS SHORTEST PATHS

    3. Problem Set #4

    4. Programming Assignment #4

  5. Week 5

    1. Watch video lessons. XVI. NP-COMPLETE PROBLEMS

    2. Watch video lessons. XVII. FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS

    3. Problem Set #5

    4. Programming Assignment #5

  6. Week 6

    1. Watch video lessons. XVIII. APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS

    2. Watch video lessons. XIX. LOCAL SEARCH ALGORITHMS

    3. Watch video lessons. XX. THE WIDER WORLD OF ALGORITHMS

    4. Problem Set #6

    5. Programming Assignment #6

  7. Final Exam

  • 2451
  • 15 July 2016, 10:20
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?