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 a review of the final exam from 2016, focusing on problems related to hashing, recurrence relations, algorithm runtime analysis, binary search trees, graph traversal, and data structure design. The slides provide detailed explanations and solutions for each problem, guiding students through the process of understanding and solving algorithmic challenges.
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