• Duración:
    6 semanas
  • Dedicación:
    2–4 horas por semana
  • Precio:

    GRATIS
    Agregar un Certificado Verificado por $149 USD

  • Institución
  • Tema:
  • Nivel:
    Intermediate
  • Idioma:
    English
  • Transcripción de video:
    English
  • Tipo de curso:
    A tu ritmo

Prerrequisitos

This specialization is an introduction to algorithms for learners with at least a little programming experience.

This course is not an introduction to programming, and it assumes that you have basic programming skills in a language such as Python, Java, or C. There are several outstanding free online courses that teach basic programming. We also use mathematical analysis as needed to understand how and why algorithms and data structures really work.

Sobre este curso

Omitir Sobre este curso

Welcome to the self paced course, Algorithms: Design and Analysis! 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.

Specific topics in the course include: "Big-oh" notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), randomized algorithms (QuickSort, contraction algorithm for min cuts), data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of BFS and DFS, connectivity, shortest paths).

Learners will practice and master the fundamentals of algorithms through several types of assessments. There are 6 multiple choice quizzes to test your understanding of the most important concepts. There are also 6 programming assignments, where you implement one of the algorithms covered in lecture in a programming language of your choosing. The course concludes with a multiple-choice final. There are no assignment due dates and you can work through the course materials and assignments at your own pace.

Lo que aprenderás

Omitir Lo que aprenderás
  • "Big-oh" notation
  • Sorting and searching
  • Divide and conquer (master method, integer and matrix multiplication, closest pair)
  • Randomized algorithms (QuickSort, contraction algorithm for min cuts)
  • Data structures (heaps, balanced search trees, hash tables, bloom filters)
  • Graph primitives (applications of BFS and DFS, connectivity, shortest paths)

Conoce a tus instructores

Tim Roughgarden
Professor of Computer Science
Stanford University

Obtén un Certificado Verificado para destacar los conocimientos y las habilidades que adquieras
$149 USD

Ver un modelo de certificado de edX en PDF
  • Oficial y verificado

    Obtén un certificado con la firma del instructor y el logotipo de la institución para demostrar tus logros y aumentar las posibilidades de conseguir trabajo

  • Fácil de compartir

    Agrega el certificado a tu currículum o publícalo directamente en LinkedIn

  • Incentivo comprobado

    El certificado te da un motivo más para completar el curso

  • Apoya nuestra labor

    edX, una organización sin fines de lucro, se sustenta con los certificados verificados para financiar la educación gratuita para todo el mundo

Preguntas frecuentes

Do I need to buy a textbook?

No. The instructor has released two books, which can provide one with a deeper understanding of the course material. The readings are suggested, but not required. The readings come from:

  • Algorithms Illuminated (Part 1): The Basics

A new book by the instructor, which is based on the first half of this course, "Algorithms: Design and Analysis, Part 1", can be found and purchased on Amazon at https://www.amazon.com/dp/0999282905.

  • Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures (Volume 2)

The next book in the series, which is based on the second half of this course, "Algorithms: Design and Analysis, Part 2", can be found and purchased on Amazon at https://www.amazon.com/dp/0999282921.