INF1A: Week 6

Functional Programming

In the sixth week of the course, in the Functional Programming strand, we'll finish expression trees and start on data representation and data abstraction. You will see different ways to implement sets and learn about how to abstract those differences away. We will also talk about the performance of each implementation.

FP Required reading: Textbook

  • Chapter 20: Data Representation
Computation and Logic

For CL Week 6, we will complete the Karnaugh Maps and finding DNF, and then make a start on Week 7 material (CNF) - see the Week 7 folder for relevant material.

CL Required Reading

  • Chapter 17 of the textbook.

Tutorial 6 - tutorial pack

FP and CL Tutorial 6 sessions are held in Week 7.
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