Master Algorithmic Programming Techniques. Learn algorithms through programming and advance your software engineering or data science career

4.6

estrellas

11,069 calificaciones

Alexander S. Kulikov +4 instructores más

231.653 ya inscrito

ofrecido por

Universidad de California en San Diego

HSE University

Programa especializado: Estructuras de datos y algoritmosUniversidad de California en San Diego

Qué aprenderás

Apply basic algorithmic techniques such as greedy algorithms, binary search, sorting and dynamic programming to solve programming challenges.

Apply various data structures such as stack, queue, hash table, priority queue, binary search tree, graph and string to solve programming challenges.

Apply graph and string algorithms to solve real-world challenges: finding shortest paths on huge maps and assembling genomes from millions of pieces.

Solve complex programming challenges using advanced techniques: maximum flow, linear programming, approximate algorithms, SAT-solvers, streaming.

Habilidades que obtendrás

DebuggingSoftware TestingAlgorithmsData StructureComputer ProgrammingDynamic ProgrammingBinary Search TreePriority QueueHash TableStack (Abstract Data Type)ListGraph Theory

Acerca de este Programa Especializado

182.871 vistas recientes

This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various computational problems and will implement about 100 algorithmic coding problems in a programming language of your choice. No other online course in Algorithms even comes close to offering you a wealth of programming challenges that you may face at your next job interview. To prepare you, we invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs. Sorry, we do not believe in multiple choice questions when it comes to learning algorithms...or anything else in computer science! For each algorithm you develop and implement, we designed multiple tests to check its correctness and running time — you will have to debug your programs without even knowing what these tests are! It may sound difficult, but we believe it is the only way to truly understand how the algorithms work and to master the art of programming. The specialization contains two real-world projects: Big Networks and Genome Assembly. You will analyze both road networks and social networks and will learn how to compute the shortest route between New York and San Francisco (1000 times faster than the standard shortest path algorithms!) Afterwards, you will learn how to assemble genomes from millions of short fragments of DNA and how assembly algorithms fuel recent developments in personalized medicine.

Proyecto de aprendizaje aplicado

The specialization contains two real-world projects: Big Networks and Genome Assembly. You will analyze both road networks and social networks and will learn how to compute the shortest route between New York and San Francisco (1000 times faster than the standard shortest path algorithms!) Afterwards, you will learn how to assemble genomes from millions of short fragments of DNA and how assembly algorithms fuel recent developments in personalized medicine.

Resultados profesionales del estudiante

36%

Comenzaste una nueva carrera profesional después de completar este programa especializado.

25%

Conseguiste un aumento de sueldo o ascenso.

Certificado para compartir

Obtén un certificado al finalizar

Cursos 100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.

Cronograma flexible

Establece y mantén fechas de entrega flexibles.

Nivel intermedio

Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala. Basic knowledge of discrete mathematics: proof by induction, proof by contradiction.

Aproximadamente 8 meses para completarse

Ritmo sugerido de 6 horas/semana

Inglés (English)

Subtítulos: Inglés (English), Árabe (Arabic), Francés (French), Portugués (europeo), Italiano, Vietnamita, Alemán (German), Ruso (Russian), Español (Spanish)

Resultados profesionales del estudiante

36%

Comenzaste una nueva carrera profesional después de completar este programa especializado.

25%

Conseguiste un aumento de sueldo o ascenso.

Certificado para compartir

Obtén un certificado al finalizar

Cursos 100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.

Cronograma flexible

Establece y mantén fechas de entrega flexibles.

Nivel intermedio

Aproximadamente 8 meses para completarse

Ritmo sugerido de 6 horas/semana

Inglés (English)

Subtítulos: Inglés (English), Árabe (Arabic), Francés (French), Portugués (europeo), Italiano, Vietnamita, Alemán (German), Ruso (Russian), Español (Spanish)

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.

Hay 6 cursos en este Programa Especializado

Curso1

Curso 1

Algorithmic Toolbox

4.6

estrellas

10,713 calificaciones

•

2,251 reseña

The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. We will learn a lot of theory: how to sort data and how it helps for searching; how to break a large problem into pieces and solve them recursively; when it makes sense to proceed greedily; how dynamic programming is used in genomic studies. You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second).

Curso2

Curso 2

estructuras de datos

4.6

estrellas

4,240 calificaciones

•

718 reseña

A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this course, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will also learn typical use cases for these data structures.

A few examples of questions that we are going to cover in this class are the following: 1. What is a good strategy of resizing a dynamic array? 2. How priority queues are implemented in C++, Java, and Python? 3. How to implement a hash table so that the amortized running time of all operations is O(1) on average? 4. What are good strategies to keep a binary tree balanced? You will also learn how services like Dropbox manage to upload some large files instantly and to save a lot of storage space!

Curso3

Curso 3

Algorithms on Graphs

4.7

estrellas

1,995 calificaciones

•

333 reseña

If you have ever used a navigation service to find optimal route and estimate time to destination, you've used algorithms on graphs. Graphs arise in various real-world situations as there are road networks, computer networks and, most recently, social networks! If you're looking for the fastest time to get to work, cheapest way to connect set of computers into a network or efficient algorithm to automatically find communities and opinion leaders in Facebook, you're going to work with graphs and algorithms on graphs.

In this course, you will first learn what a graph is and what are some of the most important properties. Then you'll learn several ways to traverse graphs and how you can do useful things while traversing the graph in some order. We will then talk about shortest paths algorithms — from the basic ones to those which open door for 1000000 times faster algorithms used in Google Maps and other navigational services. You will use these algorithms if you choose to work on our Fast Shortest Routes industrial capstone project. We will finish with minimum spanning trees which are used to plan road, telephone and computer networks and also find applications in clustering and approximate algorithms.

Curso4

Curso 4

Algorithms on Strings

4.5

estrellas

954 calificaciones

•

164 reseña

World and internet is full of textual information. We search for information using textual queries, we read websites, books, e-mails. All those are strings from the point of view of computer science. To make sense of all that information and make search efficient, search engines use many string algorithms. Moreover, the emerging field of personalized medicine uses many search algorithms to find disease-causing mutations in the human genome.

Instructores

ofrecido por

Universidad de California en San Diego

UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory.

HSE University

HSE University is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communicamathematics, engineering, and more.

Socios del sector

Preguntas Frecuentes

¿Recibiré crédito universitario por completar el programa especializado?
Esta Especialización no otorga crédito universitario, pero algunas universidades pueden aceptar los Certificados de especializaciones para obtener crédito. Consulta con tu institución para obtener más información. Los Títulos en línea y los Certificados Mastertrack™ de Coursera brindan la oportunidad de obtener créditos universitarios.
Can I just enroll in a single course?
Si estás suscrito, obtienes una prueba gratis de 7 días, que podrás cancelar cuando desees sin ningún tipo de penalidad. Una vez transcurrido ese tiempo, no realizamos reembolsos. No obstante, puedes cancelar tu suscripción cuando quieras. Consulta nuestra política completa de reembolsos.
¿Puedo inscribirme en un solo curso?
¡Sí! Para empezar, haz clic en la tarjeta del curso que te interesa e inscríbete. Puedes inscribirte y completar el curso para obtener un certificado que puedes compartir o puedes acceder al curso como oyente para ver los materiales del curso de manera gratuita. Cuando cancelas la suscripción de un curso que forma parte de un programa especializado, se cancela automáticamente la suscripción de todo el programa especializado. Visita el panel del estudiante para realizar un seguimiento de tu progreso.
Can I take the course for free?
Sí, Coursera ofrece ayuda económica a los estudiantes que no pueden pagar la tarifa. Solicítala haciendo clic en el enlace de Ayuda económica que está debajo del botón “Inscribirse” a la izquierda. Se te pedirá que completes una solicitud. Recibirás una notificación en caso de que se apruebe. Deberás completar este paso para cada uno de los cursos que forman parte del Programa especializado, incluido el proyecto final. Obtén más información.
¿Puedo tomar este curso de manera gratuita?
Cuando te inscribes en el curso, tienes acceso a todos los cursos del programa especializado y obtienes un certificado cuando completas el trabajo. Si solo deseas leer y ver el contenido del curso, puedes participar del curso como oyente de manera gratuita. Si no puedes pagar la tarifa, puedes solicitar ayuda económica.
¿Este curso es 100 % en línea? ¿Necesito asistir a alguna clase en persona?
Este curso es completamente en línea, de modo que no necesitas ir a un aula en persona. Puedes acceder a tus lecciones, lecturas y tareas en cualquier momento y cualquier lugar a través de Internet o tu dispositivo móvil.
What background knowledge is necessary?
1. Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala.
We expect you to be able to implement programs that: 1) read data from the standard input (in most cases, the input is a sequence of integers); 2) compute the result (in most cases, a few loops are enough for this); 3) print the result to the standard output. For each programming challenge in this course, we provide starter solutions in C++, Java, and Python. The best way to check whether your programming skills are enough to go through problems in this specialization is to solve two problems from the first week. If you are able to pass them (after reading our tutorials), then you will definitely be able to pass the course.
2. Basic knowledge of discrete mathematics: proof by induction, proof by contradiction.
Knowledge of discrete mathematics is necessary for analyzing algorithms (proving correctness, estimating running time) and for algorithmic thinking in general. If you want to refresh your discrete mathematics skills, we encourage you to go through our partner specialization — Introduction to Discrete Mathematics for Computer Science (https://www.coursera.org/specializations/discrete-mathematics). It teaches the basics of discrete mathematics in try-this-before-we-explain-everything approach: you will be solving many interactive puzzles that were carefully designed to allow you to invent many of the important ideas and concepts yoursel
What is the difference between this course and other courses covering algorithms?
We believe that learning the theory behind algorithms (like in most Algorithms 101 courses taught at 1000s universities) is important but not sufficient for a professional computer scientist today. This specialization combines the theory of algorithms with many programming challenges. In contrast with many Algorithms 101 courses, you will implement over 100 algorithmic problems in the programming language of your choice. And you will see yourself that the best way to understand an algorithm is to implement it!
How long does it take to complete the Specialization?
Time to completion can vary based on your schedule, but most learners are able to complete the Specialization in 6-8 months.
¿Cuánto tiempo se necesita para completar un programa especializado?
Each course in the Specialization is offered on a regular schedule, with sessions starting about once per month. If you don't complete a course on the first try, you can easily transfer to the next session, and your completed work and grades will carry over.
¿Con qué frecuencia se ofrece cada curso del programa especializado?
Basic knowledge of at least one programming language (C/C++, Java, Python): loops, arrays, stacks, recursion. Basic knowledge of mathematics: proof by induction, proof by contradiction.
Do I need to take the courses in a specific order?
We recommend taking the courses in the order presented, as each subsequent course will build on material from previous courses.
Will I earn university credit for completing the Specialization?
Coursera courses and certificates don't carry university credit, though some universities may choose to accept Specialization Certificates for credit. Check with your institution to learn more.
¿Recibiré crédito universitario por completar el programa especializado?
The lectures in this specialization will be self-contained. Most lectures will be based on the bestselling textbook "Algorithms" co-authored by Sanjoy Dasgupta from University of California at San Diego as well as Christos Papadimitriou and Umesh Vazirani from University of California at Berkeley. In addition to UCSD and Berkeley, the textbook has been adopted in over 100 top universities and is available on Internet.

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