SOBRE ESTE EPISÓDIO
This lecture covers dynamic programming, optimal path, overlapping subproblems, specifications, restrictions, efficiency, and pseudo-polynomials.
Inglês
Estados Unidos da América
TRANSCRIÇÃO 🔗
Are you the producer of this podcast?
Add a podcast transcript
Need Audio-to-Text?
Transcribe with Listen411 in Just 60 Seconds
PESQUISAR EPISÓDIOS PASSADOS
Pesquisar episódios anteriores de OCW Scholar: Introduction to Computer Science and Programming.
OUTROS EPISÓDIOS NESTE PODCAST
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.
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.
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.
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
Aviso: O podcast e a arte incorporada nesta página são de Prof. John Guttag, que é propriedade de seu proprietário e não é afiliado ou endossado por Listen Notes, Inc.
EDITAR
Obrigado por ajudar a manter a base de dados dos podcasts atualizada.
