ESF logo        EIC logo


Programming Techniques, Recursion, Exhaustive Search, Dynamic Programming

Author: PhD Jaanus Pöial, Estonian IT College

All videoclips are captured during fall semester of 2011 when the course was taught in English.

Learning outcomes:
  1. Student knows the basic definitions (recursion, dynamic programming) and complexity properties (exhaustive search, branch and bound method)
  2. Student is able to use backtracking technique for exhaustive search
  3. Student is able to implement recursive algorithms and translate loop to recursion and recursion to loop using stack
Video (123 min)
Video 1 - Recursion, elimination of recursion
Video 2 - Tail recursion, exhaustive search, backtracking, branch and bound method
Video 3 - Dynamic programming
Lecture Notes
Lecture 1 - Recursion, exhaustive search (in Estonian: rekursioon, ammendav otsing)
Lecture 2 - Dynamic programming (in Estonian: dünaamiline kavandamine)
Extra

BeST logo

Creative Commonsi litsents
See teos on litsentseeritud Creative Commonsi Autorile viitamine + Mitteäriline eesmärk + Jagamine samadel tingimustel 3.0 Jurisdiktsiooniga sidumata litsentsiga.