JCL

FEUP/DEI & INESC TEC

User Tools

Site Tools


teach:fpro:lectures:13

LE13: 30/11/2020

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


Lecture #13 :: 30/11/2020

Goals

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

Content

  • 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

Bibliography

  • 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)

Materials

Summary

  • 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