Skip to main content

INF1A - top navigation

  • Learn
  • Piazza
  • DRPS

Breadcrumb

  1. Home
  2. INF1A: Informatics 1 - Introduction to Computation

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 lecture 17-18: Combinatorial Algorithms (code)

FP required reading: Textbook

  • Chapter 26: Combinatorial Algorithms
Computation and Logic

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

  • CL-17-18: 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):
  • FP Tutorial 9: Content / Informatics 1 - Introduction to Computation (2023-2024)[SEM1] (ed.ac.uk)
  • CL Tutorial 9: Content / Informatics 1 - Introduction to Computation (2023-2024)[SEM1] (ed.ac.uk)
License
All rights reserved The University of Edinburgh

Book traversal links for INF1A: Week 9

  • INF1A: Week 8
  • Up
  • INF1A: Week 10

Navigation links

  • INF1A: Course Materials
  • INF1A: Resource List
  • INF1A: Assessment
  • INF1A FP Competition
  • INF1A: Maths for Computing
  • INF1A: Week 1
  • INF1A: Week 2
  • INF1A: Week 3
  • INF1A: Week 4
  • INF1A: Week 5
  • INF1A: Week 6
  • INF1A: Week 7
  • INF1A: Week 8
  • INF1A: Week 9
  • INF1A: Week 10
  • INF1A: Week 11
RSS feed

Opencourse privacy & accessibility statements; contact Informatics, ILTS.