Informações sobre o curso: 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).
Para quem é direcionado este curso: 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.
Desenvolvido por: Stanford University
Ministrado por: Tim Roughgarden, Professor
Computer Science
| Informações básicas | Curso 1 de 4 no Algorithms Specialization |
| Nível | Intermediário |
| Compromisso | 4 weeks of study, 4-8 hours/week |
| Idioma | English |
| Como ser aprovado | Seja aprovado em todas as tarefas para concluir o curso. |
| Classificação do usuário |
Programa
SEMANA 1
Week 1
Introduction; "big-oh" notation and asymptotic analysis.
13 videos, 3 leituras
- Reading: Welcome and Week 1 Overview
- Reading: Overview, Resources, and Policies
- Reading: Lecture slides
- Vídeo: Integer Multiplication
- Vídeo: Karatsuba Multiplication
- Vídeo: About the Course
- Vídeo: Merge Sort: Motivation and Example
- Vídeo: Merge Sort: Pseudocode
- Vídeo: Merge Sort: Analysis
- Vídeo: Guiding Principles for Analysis of Algorithms
- Vídeo: The Gist
- Vídeo: Big-Oh Notation
- Vídeo: Basic Examples
- Vídeo: Big Omega and Theta
- Vídeo: Additional Examples [Review - Optional]
Nota atribuída: Problem Set #1
Nota atribuída: Programming Assignment #1
SEMANA 2
Week 2
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
11 videos, 2 leituras
- Reading: Week 2 Overview
- Vídeo: O(n log n) Algorithm for Counting Inversions II
- Vídeo: Strassen's Subcubic Matrix Multiplication Algorithm
- Vídeo: O(n log n) Algorithm for Closest Pair I [Advanced - Optional]
- Vídeo: O(n log n) Algorithm for Closest Pair II [Advanced - Optional]
- Vídeo: Motivation
- Vídeo: Formal Statement
- Vídeo: Examples
- Vídeo: Proof I
- Vídeo: Interpretation of the 3 Cases
- Vídeo: Proof II
- Reading: Optional Theory Problems (Batch #1)
Nota atribuída: Problem Set #2
Nota atribuída: Programming Assignment #2
SEMANA 3
Week 3
The QuickSort algorithm and its analysis; probability review.
9 videos, 1 leituras
- Reading: Week 3 Overview
- Vídeo: Partitioning Around a Pivot
- Vídeo: Correctness of Quicksort [Review - Optional]
- Vídeo: Choosing a Good Pivot
- Vídeo: Analysis I: A Decomposition Principle
- Vídeo: Analysis II: The Key Insight
- Vídeo: Analysis III: Final Calculations
- Vídeo: Probability Review I
- Vídeo: Probability Review II
Nota atribuída: Problem Set #3
Nota atribuída: Programming Assignment #3
SEMANA 4
Week 4
Linear-time selection; graphs, cuts, and the contraction algorithm.
11 videos, 3 leituras
- Reading: Week 4 Overview
- Vídeo: Randomized Selection - Analysis
- Vídeo: Deterministic Selection - Algorithm [Advanced - Optional]
- Vídeo: Deterministic Selection - Analysis I [Advanced - Optional]
- Vídeo: Deterministic Selection - Analysis II [Advanced - Optional]
- Vídeo: Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional]
- Vídeo: Graphs and Minimum Cuts
- Vídeo: Graph Representations
- Vídeo: Random Contraction Algorithm
- Vídeo: Analysis of Contraction Algorithm
- Vídeo: Counting Minimum Cuts
- Reading: Optional Theory Problems (Batch #2)
- Reading: Info and FAQ for final exam
Nota atribuída: Problem Set #4
Nota atribuída: Programming Assignment #4
Nota atribuída: Final Exam
Perguntas frequentes
Como funciona
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.
Desenvolvedores
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.
Custo
| Comprar curso | |
|---|---|
| Acesso aos materiais do curso | Disponível |
| Acesso a materiais valendo nota | Disponível |
| Receba uma nota final | Disponível |
| Obtenha um Certificado de Curso compartilhável | Disponível |
Classificações e avaliações
it ‘s a challenge course ，but give me a useful theory to learn other divide and conquer algorithm
I am a professional software engineer and I've made it through week 3 of this course so far. The lectures are well done, easy to follow, and it feels like a 1-on-1 tutoring session with one of the world's top professors.
I already feel like I have grown as an engineer after implementing merge sort to find array inversions (among other exercises and assignments). I can't wait to see what's next!
According to completed assignment, I think I get a lot.
O Coursera proporciona acesso universal à melhor educação do mundo fazendo parcerias com as melhores universidades e organizações para oferecer cursos on-line.
© 2018 Coursera Inc. Todos os direitos reservados.
It's good enough but lack of thorough analysis