These recordings do not require passwords, but you may have to login after clicking on the links. These are the lectures from 2020.

26A Dynamic Programming Introduction

Part 1 (8:32)

Link: https://rensselaer.webex.com/rensselaer/ldr.php?RCID=5f25f42a3e5f4a4ab4853c5fc4142754

Part 2 (8:45)

Link: https://rensselaer.webex.com/rensselaer/ldr.php?RCID=50c8cc4face6bbca0a562e43731b9da0

Part 3 (3:39)

Link: https://rensselaer.webex.com/rensselaer/ldr.php?RCID=047b8832a19b41f2a2f1f046b8ea3f0b

26B Dijkstra’s Algorithm

Part 1 (15:44)

Link: https://rensselaer.webex.com/rensselaer/ldr.php?RCID=aa2cf8aeef5744e9810e989fd61755fd

Part 2 (13:39)

Link: https://rensselaer.webex.com/rensselaer/ldr.php?RCID=4691f9156d8d4d5e93e209a9b21146b0

26C Knapsack Using DP

Part 1 (10:28)

Link: https://rensselaer.webex.com/rensselaer/ldr.php?RCID=ff7a9099072e4e708a17b692ccef3b1f

Part 2 (13:47)

Link: https://rensselaer.webex.com/rensselaer/ldr.php?RCID=1818d4bdbf8544948cdb13df4180b634

Part 3 (11:14)

Link: https://rensselaer.webex.com/rensselaer/ldr.php?RCID=38a1741107d0444c90d5d6cffecd37bc

Part 4 (8:00)

Link: https://rensselaer.webex.com/rensselaer/ldr.php?RCID=95f5d6b0852b4100bed51372dcb8a0f5

26D Longest Path Problems

Part 1 (11:49)

Link: https://rensselaer.webex.com/rensselaer/ldr.php?RCID=d35a78f376bf4d6c9a177dfb42e27d45

Part 2 (12:02)

Link: https://rensselaer.webex.com/rensselaer/ldr.php?RCID=c4010e18347a413f8a3ba283c9082761

Part 3 (4:36)

Link: https://rensselaer.webex.com/rensselaer/ldr.php?RCID=20b14ccdf9344305b20cd2dca0299224