À propos de ce cours : The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
Les destinataires de ce cours : Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.
Créé par : Stanford University
Enseigné par : Tim Roughgarden, Professor
Computer Science
| Informations de base | Cours 1 de 4 dans Algorithms Specialization |
| Niveau | Intermédiaire |
| Engagement | 4 weeks of study, 4-8 hours/week |
| Langue | English |
| Comment réussir | Réussissez tous les devoirs notés pour terminer le cours. |
| Notes des utilisateurs |
Programme de cours
SEMAINE 1
Week 1
Introduction; "big-oh" notation and asymptotic analysis.
13 vidéos, 3 lectures
- 阅读: Welcome and Week 1 Overview
- 阅读: Overview, Resources, and Policies
- 阅读: Lecture slides
- Vidéo: Integer Multiplication
- Vidéo: Karatsuba Multiplication
- Vidéo: About the Course
- Vidéo: Merge Sort: Motivation and Example
- Vidéo: Merge Sort: Pseudocode
- Vidéo: Merge Sort: Analysis
- Vidéo: Guiding Principles for Analysis of Algorithms
- Vidéo: The Gist
- Vidéo: Big-Oh Notation
- Vidéo: Basic Examples
- Vidéo: Big Omega and Theta
- Vidéo: Additional Examples [Review - Optional]
Noté: Problem Set #1
Noté: Programming Assignment #1
SEMAINE 2
Week 2
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
11 vidéos, 2 lectures
- 阅读: Week 2 Overview
- Vidéo: O(n log n) Algorithm for Counting Inversions II
- Vidéo: Strassen's Subcubic Matrix Multiplication Algorithm
- Vidéo: O(n log n) Algorithm for Closest Pair I [Advanced - Optional]
- Vidéo: O(n log n) Algorithm for Closest Pair II [Advanced - Optional]
- Vidéo: Motivation
- Vidéo: Formal Statement
- Vidéo: Examples
- Vidéo: Proof I
- Vidéo: Interpretation of the 3 Cases
- Vidéo: Proof II
- 阅读: Optional Theory Problems (Batch #1)
Noté: Problem Set #2
Noté: Programming Assignment #2
SEMAINE 3
Week 3
The QuickSort algorithm and its analysis; probability review.
9 vidéos, 1 lectures
- 阅读: Week 3 Overview
- Vidéo: Partitioning Around a Pivot
- Vidéo: Correctness of Quicksort [Review - Optional]
- Vidéo: Choosing a Good Pivot
- Vidéo: Analysis I: A Decomposition Principle
- Vidéo: Analysis II: The Key Insight
- Vidéo: Analysis III: Final Calculations
- Vidéo: Probability Review I
- Vidéo: Probability Review II
Noté: Problem Set #3
Noté: Programming Assignment #3
SEMAINE 4
Week 4
Linear-time selection; graphs, cuts, and the contraction algorithm.
11 vidéos, 3 lectures
- 阅读: Week 4 Overview
- Vidéo: Randomized Selection - Analysis
- Vidéo: Deterministic Selection - Algorithm [Advanced - Optional]
- Vidéo: Deterministic Selection - Analysis I [Advanced - Optional]
- Vidéo: Deterministic Selection - Analysis II [Advanced - Optional]
- Vidéo: Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional]
- Vidéo: Graphs and Minimum Cuts
- Vidéo: Graph Representations
- Vidéo: Random Contraction Algorithm
- Vidéo: Analysis of Contraction Algorithm
- Vidéo: Counting Minimum Cuts
- 阅读: Optional Theory Problems (Batch #2)
- 阅读: Info and FAQ for final exam
Noté: Problem Set #4
Noté: Programming Assignment #4
Noté: Final Exam
FAQ
Comment cela fonctionne
课程作业
每门课程都像是一本互动的教科书，具有预先录制的视频、测验和项目。
来自同学的帮助
与其他成千上万的学生相联系，对想法进行辩论，讨论课程材料，并寻求帮助来掌握概念。
证书
获得正式认证的作业，并与朋友、同事和雇主分享您的成功。
Créateurs
Stanford University
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
Tarification
| Acheter le cours | |
|---|---|
| Accéder au contenu du cours | Disponible |
| Accéder au contenu noté | Disponible |
| Recevoir une Note Finale | Disponible |
| Obtenir un Certificat de Cours partageable | Disponible |
Notation et examens
Well researched. Topics covered well, with walkthrough for exam.le cases for each new introduced algorithm. Great experience, learned a lot of important algorithms and algorithmic thinking practices.
Interesting and well structured course. The material is basic, but has enough depth to be challenging for someone who, like me, has minimal programming experience. The instructor explains the material very well and is engaging.
A big plus is that, unlike other similar courses, you can apply the material and answer the quizzes with any programming language you see fit.
One of the best courses I have taken online!
Coursera propose un accès universel à la meilleure formation au monde,
en partenariat avec des universités et des organisations du plus haut niveau, pour proposer des cours en ligne.
© 2018 Coursera Inc. Tous droits réservés.
MA
Very nice course, but some parts are not clear because the instructor talks really fast and goes over some parts very quickly.