Sobre este programa especializado

Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.

About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.

...
Globe

Cursos 100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.
Calendar

Cronograma flexible

Establece y mantén fechas de entrega flexibles.
Intermediate Level

Nivel intermedio

Clock

Approx. 4 months to complete

Suggested 7 hours/week
Comment Dots

English

Subtítulos: English...

Habilidades que obtendrás

AlgorithmsDynamic ProgrammingGreedy AlgorithmDivide And Conquer Algorithms
Globe

Cursos 100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.
Calendar

Cronograma flexible

Establece y mantén fechas de entrega flexibles.
Intermediate Level

Nivel intermedio

Clock

Approx. 4 months to complete

Suggested 7 hours/week
Comment Dots

English

Subtítulos: English...

Cómo funciona el programa especializado

Toma cursos

Un programa especializado de Coursera es un conjunto de cursos que te ayudan a dominar una aptitud. Para comenzar, inscríbete en el programa especializado directamente o échale un vistazo a sus cursos y elige uno con el que te gustaría comenzar. Al suscribirte a un curso que forme parte de un programa especializado, quedarás suscrito de manera automática al programa especializado completo. Puedes completar solo un curso: puedes pausar tu aprendizaje o cancelar tu suscripción en cualquier momento. Visita el panel principal del estudiante para realizar un seguimiento de tus inscripciones a cursos y tu progreso.

Proyecto práctico

Cada programa especializado incluye un proyecto práctico. Necesitarás completar correctamente el proyecto para completar el programa especializado y obtener tu certificado. Si el programa especializado incluye un curso separado para el proyecto práctico, necesitarás completar cada uno de los otros cursos antes de poder comenzarlo.

Obtén un certificado

Cuando completes todos los cursos y el proyecto práctico, obtendrás un Certificado que puedes compartir con posibles empleadores y tu red profesional.

how it works

Hay 4 cursos en este Programa Especializado

Curso1

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

4.8
2,022 calificaciones
398 revisiones
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)....
Curso2

Graph Search, Shortest Paths, and Data Structures

4.8
888 calificaciones
106 revisiones
The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis)....
Curso3

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

4.8
560 calificaciones
65 revisiones
The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees)....
Curso4

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

4.8
343 calificaciones
41 revisiones
The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search)....

Instructores

Tim Roughgarden

Professor
Computer Science

Acerca de 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....

Preguntas Frecuentes

  • Yes! To get started, click the course card that interests you and enroll. You can enroll and complete the course to earn a shareable certificate, or you can audit it to view the course materials for free. When you subscribe to a course that is part of a Specialization, you’re automatically subscribed to the full Specialization. Visit your learner dashboard to track your progress.

  • This course is completely online, so there’s no need to show up to a classroom in person. You can access your lectures, readings and assignments anytime and anywhere via the web or your mobile device.

  • This Specialization doesn't carry university credit, but some universities may choose to accept Specialization Certificates for credit. Check with your institution to learn more.

  • The Specialization has four four-week courses, for a total of sixteen weeks.

  • Learners should know how to program in at least one programming language (like C, Java, or Python); some familiarity with proofs, including proofs by induction and by contradiction; and some discrete probability, like how to compute the probability that a poker hand is a full house. At Stanford, a version of this course is taken by sophomore, junior, and senior-level computer science majors.

  • For best results, the courses should be taken in order.

  • Having taken your programming and thinking skills to the next level, you will be well positioned to ace your technical interviews, pursue serious software engineering, and study advanced topics in algorithms.

¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.