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 advanced counting techniques, logic, structures underlying solutions, algorithm speed, and probabilities. It explores solving linear homogeneous recurrence relations, the Tower of Hanoi puzzle, and finding recurrence relations for bit strings. The instructor explains how to determine the characteristic equation, find roots, and solve linear homogeneous recurrence relations.