Este curso forma parte de Programa Especializado - Algorithms
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
ofrecido por
Habilidades que obtendrás
Programa - Qué aprenderás en este curso
Week 1
Week 2
Week 3
Week 4
67%
83%
Principales revisiones
Fantastic course that covered a good variety of content in sufficient details and delves into the fundamentals without sacrificing clarity.
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
Instructor
Tim Roughgarden
ProfessorAcerca de Stanford University
Acerca del programa especializado Algorithms
Preguntas Frecuentes
When will I have access to the lectures and assignments?
Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.
What will I get if I subscribe to this Specialization?
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
What is the refund policy?
Is financial aid available?
¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.
