ACERCA DE ESTE EPISODIO
This lecture covers dynamic programming, optimal path, overlapping subproblems, specifications, restrictions, efficiency, and pseudo-polynomials.
Inglés
Estados Unidos
TRANSCRIPCIÓN 🔗
Are you the producer of this podcast?
Add a podcast transcript
Need Audio-to-Text?
Transcribe with Listen411 in Just 60 Seconds
BUSCAR EPISODIOS ANTERIORES
Buscar episodios anteriores de OCW Scholar: Introduction to Computer Science and Programming.
OTROS EPISODIOS EN ESTE PODCAST
This recitation reviews the details of directed and undirected node graphs as well as explaining the difference between depth-first search and breath-first search with an extensive explanation of the code involved in graph creation and the search methods
This recitation reviews hierarchical and kmeans clustering in great detail with many different code examples. It also discusses the merits and disadvantages of both clustering and how to calculate error.
In this review session the solution to practice quiz 2 are presented in detail, and the main topics of unit 2 (on the quiz 2 topics sheet) as well as some technical topics are explained with some code examples.
In this recitation, the class wraps up with dynamic programming and specifically the technique of memoization. Many code examples are presented to show all the applications of this technique.
Descargo de responsabilidad: El podcast y el arte incluidos en esta página son de Prof. John Guttag, que es propiedad de su propietario y no está afiliado ni respaldado por Listen Notes, Inc.
EDITAR
Gracias por ayudar a mantener actualizada la base de datos de podcasts.
