teach:fpro:lectures:13

**Master in Informatics and Computing Engineering
Programming Fundamentals
Instance: 2020/2021**

—

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

- Describe recursive algorithms
- Describe how to process recursive data structures
- Describe infinite recursion and mutual recursion
- Describe significant case studies that are recursive by nature
- Describe how recursion is implemented by a computer system

- Recursion
- Case study: factorial
- Scope of a recursive function
- 10.1 Drawing Fractals
- 10.2 Recursive data structures
- 10.3 Processing recursive number lists
- Infinite recursion
- 10.4 Case study: Fibonacci numbers
- 10.5 Example with recursive directories and files
- 10.7 Mutual Recursion

- Peter Wentworth, Jeffrey Elkner, Allen B. Downey, and Chris Meyers,
*How to Think Like a Computer Scientist — Learning with Python 3*, Release 3rd Edition, 2020 [PDF] (Chapter 10)

- J. Correia Lopes,
*Study materials*, GitHub (Notebook 13) - Brad Miller and David Ranum,
*Learning with Python: Interactive Edition*. Based on material by Jeffrey Elkner, Allen B. Downey, and Chris Meyers [HTML] (Chapter 16) - ZOOM lecture's room (requires password): https://videoconf-colibri.zoom.us/j/83800564127
- Moodle, Moodle > Activity LE13

- Recursion. Recursive case studies: factorial, Fibonacci numbers, fractals. Recursive data structures. Mutual recursion. Infinite recursion.

— *FPRO, 2020/21*

« Previous | Index | Next »

teach/fpro/lectures/13.txt · Last modified: 03/01/2021 17:42 by Correia Lopes