INF1A: Week 8
| Functional Programming | In the eighth week of the course, in the Functional Programming strand, we'll talk about type classes, including ones you have seen before like Eq, Ord, and Show. We'll also cover different strategies for searching in trees.
FP required reading: Textbook
|
| Computation and Logic | For CL Week 8, we will learn how to efficiently convert expressions to CNF and how to count satisfying valuations using the arrow rule. In week 8, we look at boolean algebra and its use for conversion to CNF; at logic gates and the Tseytin transformation for fast conversion to CNF; and at the implication graph method for counting solutions to certain CNF problems. CL Required reading
|
Tutorial 8 - tutorial pack
FP and CL Tutorial 8 sessions are held in Week 9.
Direct search links to materials on Learn (note that the tutorial materials only become available after the deadline of the previous tutorial):
Files
License
All rights reserved The University of Edinburgh