Este curso forma parte de Programa especializado: Data Science Foundations: Data Structures and Algorithms

4.8
estrellas
56 calificaciones

Sriram Sankaranarayanan

7011 ya inscrito

Ofrecido Por

Parte del título de grado Master of Science in Data Science
Más información

Programa especializado: Data Science Foundations: Data Structures and AlgorithmsUniversidad de Colorado en Boulder

Acerca de este Curso

86.989 vistas recientes

Basic algorithms on tree data structures, binary search trees, self-balancing trees, graph data structures and basic traversal algorithms on graphs. This course also covers advanced topics such as kd-trees for spatial data and algorithms for spatial data.
Trees and Graphs: Basics can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform. The MS-DS is an interdisciplinary degree that brings together faculty from CU Boulder’s departments of Applied Mathematics, Computer Science, Information Science, and others. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics. Learn more about the MS-DS program at https://www.coursera.org/degrees/master-of-science-data-science-boulder.

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.

Certificado para compartir

Obtén un certificado al finalizar

100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.

Curso 2 de 3 en

Programa especializado: Data Science Foundations: Data Structures and Algorithms

Nivel avanzado

Completion of the previous course. Calculus, probability theory: distributions, expectations and moments. Some programming experience with Python.

Aprox. 34 horas para completar

Inglés (English)

Qué aprenderás

Define basic tree data structures and identify algorithmic functions associated with them
Execute traversals and create graphs within a binary search tree structure
Describe strongly connected components in graphs

Habilidades que obtendrás

Analysis of Algorithms
Algorithm Design
Python Programming
Data Structure Design
Graphs Algorithms

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.

Certificado para compartir

Obtén un certificado al finalizar

100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.

Curso 2 de 3 en

Programa especializado: Data Science Foundations: Data Structures and Algorithms

Nivel avanzado

Completion of the previous course. Calculus, probability theory: distributions, expectations and moments. Some programming experience with Python.

Aprox. 34 horas para completar

Inglés (English)

Instructor

Calificación del instructor

4,95/5 (24 calificaciones)

Sriram Sankaranarayanan

Professor

Department of Computer Science

25.303 alumnos

3 cursos

Ofrecido por

Universidad de Colorado en Boulder

Comienza a trabajar para obtener tu maestría

Este curso es parte del Master of Science in Data Science completamente en línea de Universidad de Colorado en Boulder. Si te aceptan en el programa completo, tus cursos cuentan para tu título de grado.

Más información

Programa - Qué aprenderás en este curso

Semana

Semana 1

10 horas para completar

Binary Search Trees and Algorithms on Trees

10 horas para completar

5 videos (Total 147 minutos), 9 lecturas, 6 cuestionarios

5 videos

Binary Search Trees -- Introduction and Properties22m

Binary Search Trees -- Insertion and Deletion31m

Red-Black Trees Basics33m

Red-Black Trees -- Rotations/Algorithms for Insertion (and Deletion)29m

Skip Lists30m

9 lecturas

Welcome and Where to Find Help10m

Important Prerequisites10m

Logistics: Textbook and Readings10m

Overview of Module 110m

Reading CLRS Chapter 1210m

CLRS Chapter 12.1-12.310m

CLRS Chapter 13 - 13.110m

CLRS Chapter 13.2 - 13.310m

Skip 10m

5 ejercicios de práctica

Basics of Binary Search Trees30m

Binary Search Tree: Insert and Delete30m

Red-Black Tree Basics30m

Tree Rotations30m

Skip Lists30m

Semana

Semana 2

8 horas para completar

Basics of Graphs and Graphs Traversals

8 horas para completar

7 videos (Total 125 minutos), 6 lecturas, 5 cuestionarios

7 videos

Graphs and Their Representations14m

Graph Traversals and Breadth First Traversal17m

Depth First Search33m

Topological Sorting and Applications11m

Strongly Connected Components - Definitions15m

Strongly Connected Components - Properties16m

Strongly Connected Components - Algorithm16m

6 lecturas

Overview of Module 210m

CLRS Chapter 22 (Section 22.1)10m

CLRS Chapter 22 (Section 22.2)10m

CLRS Chapter 22 (Section 22.3)10m

CLRS Chapter 22 (Section 22.410m

CLRS Chapter 22 (Section 22.5)10m

4 ejercicios de práctica

Graph Representations30m

Combined Quiz on Graph Traversals30m

Topological Sort Graphs30m

Strongly Connected Components30m

Semana

Semana 3

8 horas para completar

Union-Find Data Structures and Spanning Tree Algorithms

8 horas para completar

5 videos (Total 127 minutos), 5 lecturas, 5 cuestionarios

5 videos

Amortized Analysis of Data Structures27m

Amortized Analysis: Potential Functions26m

Spanning Trees and Minimal Spanning Trees with Applications26m

Kruskal’s Algorithm for Finding Minimal Spanning Trees8m

Union-Find Data Structures and Rank Compression38m

5 lecturas

Overview of Module 310m

CLRS Chapter 1710m

CLRS Chapter 23 (Section 23.1)10m

CLRS Chapter 23 (Section 23.2)10m

CLRS Chapter 2110m

4 ejercicios de práctica

Amortized Analysis30m

Minimum Spanning Tree30m

Kruskal's Algorithm30m

Disjoint Set Forest30m

Semana

Semana 4

8 horas para completar

Shortest Path Algorithms

8 horas para completar

6 videos (Total 155 minutos), 6 lecturas, 4 cuestionarios

6 videos

Shortest Path Problems and Their Properties29m

Bellman-Ford Algorithm for Single Source Shortest Paths45m

Dijkstra’s Algorithm for Single Source Shortest Paths with Nonnegative Edge Weights20m

Proof of Dijkstra's Algorithm12m

Shortest Path on DAGs11m

All Pairs Shortest Path Problems and Floyd-Warshall’s Algorithm34m

6 lecturas

Overview of Module 410m

CLRS Chapter 24 (up to section 24.1)10m

CLRS Chapter 24 (Section 24.1)10m

CLRS Chapter 24 (Section 24.3 and 24.5)10m

CLRS Chapter 24 (Section 24.2)10m

CLRS Chapter 25 (Sections 25.1 and 25.2)10m

3 ejercicios de práctica

Shortest Path Problems Properties30m

Shortest Path - Bellman Ford Algorithm30m

Dijkstra's Algorithm30m

Reseñas

4.8

16 reseña

5 stars
82,14 %
4 stars
14,28 %
3 stars
3,57 %

Principales reseñas sobre TREES AND GRAPHS: BASICS

por MH1 de ene. de 2023

Excellent content. Lectures along with textbook provide student with working knowledge of trees and graphs.

por DN28 de sep. de 2022

This course is easy to understand and implement. It needs more programming exercises further!

por MC25 de dic. de 2022

Excellent explanation of complex topics. The coding exercise are also well thought out and the tips along the way help to reinforce key concepts.

por AP29 de mar. de 2022

I have grade 100% My mail id- freespace644@gmail.com

Ver todas las reseñas

Acerca de Programa especializado: Data Science Foundations: Data Structures and Algorithms

Building fast and highly performant data science applications requires an intimate knowledge of how data can be organized in a computer and how to efficiently perform operations such as sorting, searching, and indexing. This course will teach the fundamentals of data structures and algorithms with a focus on data science applications. This specialization is targeted towards learners who are broadly interested in programming applications that process large amounts of data (expertise in data science is not required), and are familiar with the basics of programming in python. We will learn about various data structures including arrays, hash-tables, heaps, trees and graphs along with algorithms including sorting, searching, traversal and shortest path algorithms.

The courses in this specialization can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform. The MS-DS is an interdisciplinary degree that brings together faculty from CU Boulder’s departments of Applied Mathematics, Computer Science, Information Science, and others. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics. Learn more about the MS-DS program at https://www.coursera.org/degrees/master-of-science-data-science-boulder.

Data Science Foundations: Data Structures and Algorithms

Preguntas Frecuentes

¿Cuándo podré acceder a las lecciones y tareas?
El acceso a las clases y las asignaciones depende del tipo de inscripción que tengas. Si tomas un curso en modo de oyente, verás la mayoría de los materiales del curso en forma gratuita. Para acceder a asignaciones calificadas y obtener un certificado, deberás comprar la experiencia de Certificado, ya sea durante o después de participar como oyente. Si no ves la opción de oyente:
es posible que el curso no ofrezca la opción de participar como oyente. En cambio, puedes intentar con una Prueba gratis o postularte para recibir ayuda económica.
Es posible que el curso ofrezca la opción 'Curso completo, sin certificado'. Esta opción te permite ver todos los materiales del curso, enviar las evaluaciones requeridas y obtener una calificación final. También significa que no podrás comprar una experiencia de Certificado.
¿Qué recibiré si me suscribo a este Programa especializado?
Cuando te inscribes en un curso, obtienes acceso a todos los cursos que forman parte del Programa especializado y te darán un Certificado cuando completes el trabajo. Se añadirá tu Certificado electrónico a la página Logros. Desde allí, puedes imprimir tu Certificado o añadirlo a tu perfil de LinkedIn. Si solo quieres leer y visualizar el contenido del curso, puedes auditar el curso sin costo.
¿Hay ayuda económica disponible?
Sí. En ciertos programas de aprendizaje, puedes postularte para recibir ayuda económica o una beca en caso de no poder costear los gastos de la tarifa de inscripción. Si hay ayuda económica o becas disponibles para tu selección de programa de aprendizaje, verás un enlace para postularte en la página de descripción.

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

Trees and Graphs: Basics

Acerca de este Curso

Qué aprenderás

Habilidades que obtendrás