INF1A: Week 9

Functional Programming

In the ninth week of the course, in the Functional Programming strand, we'll talk about combinatorial algorithms. This will take place across two lectures.

FP required reading: Textbook

  • Chapter 26: Combinatorial Algorithms
Computation and Logic

For CL Week 9, we will learn about Finite State Machines.

CL Required reading

  • Chapter 27, Finite Automata
  • Chapter 28, Deterministic Finite Automata

Tutorial 9 - tutorial pack

FP and CL Tutorial 9 sessions are held in Week 10.
Direct search links to materials on Learn (note that the tutorial materials only become available after the deadline of the previous tutorial):
License
All rights reserved The University of Edinburgh