teach:fpro:lectures:18

**Master in Informatics and Computing Engineering
Programming Fundamentals
Instance: 2018/2019**

—

By the end of this class, the student should be able to:

- Identify some complex problems, that may otherwise be difficult to solve, that may have a simple recursive solution
- Describe how to formulate programs recursively
- Describe recursion as a form of iteration
- Implement the recursive formulation of a problem

- Case study: Tower of Hanoi
- Iteration vs. Recursion
- Calculating the sum of a list of numbers
- Factorial
- Fibonacci
- Is a palindrome
- Converting to any base

- Summary

- J. Correia Lopes,
*Script and illustrations*, 18-more-recursion.pdf - FPRO, 2018/19,
*Python code*, Lecture's on GitHub

- Recursive case studies: Tower of Hanoi. Recursion versus Iteration: Calculating the sum of a list of numbers, Factorial, Fibonacci, Is a Palindrome, Converting to any base.

— *FPRO, 2018/19*

« Previous | Index | Next »

teach/fpro/lectures/18.txt · Last modified: 29/11/2018 19:08 by Correia Lopes