Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of Optimal Binary Search Trees, explaining the bottom-up approach to calculate the expected search cost. The instructor demonstrates the dynamic programming algorithm, discussing the pseudocode and runtime analysis. The lecture also includes a section on solving a midterm exam from 2016, focusing on algorithmic problem-solving strategies.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace