À 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
- Reading: Welcome and Week 1 Overview
- Reading: Overview, Resources, and Policies
- Reading: 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
- Reading: 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
- Reading: 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 lecture
- Reading: 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
- Reading: 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
- Reading: Optional Theory Problems (Batch #2)
- Reading: Info and FAQ for final exam
Noté: Problem Set #4
Noté: Programming Assignment #4
Noté: Final Exam
FAQ
Comment cela fonctionne
Coursework
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Help from Your Peers
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Certificates
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
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-taught, I love Tim Roughgarden's lecture style. Though he doesn't pull punches when it comes to the math, it's very straightforward and easy to follow.
I like this course! Specially programming assignments were challenging. Enjoyed throughout the session.
Thanks coursera for giving the best course !!!
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.
GS
This course is amazing!!!