INF1A: Week 3

Functional Programming

In the third week of the course we'll continue the recursion theme, with examples using recursion on lists and on natural numbers. We will meet the useful functions zip, select (!!), take, and drop.

FP required reading: Textbook

  • Chapter 11: More Fun with Recursion
Computation and Logic

In the Computation and Logic strand, we'll learn more about Aristotelian Syllogisms. We'll discuss Contraposition of Propositions, we'll present Aristotle's Square of Opposition, see how we can use Venn diagrams to show that a syllogism is sound, and practise giving justifications and counterexamples. We cover all these topics in one course section:  

CL Required reading: Textbook chapters

  • Chapter 8: Patterns of Reasoning
  • Chapter 9: More Patterns of Reasoning

Engage with the slides for lectures, required readings, and post-lecture quizzes. The quizzes are a chance for you to gauge your understanding of the material presented, and so we strongly encourage you to review this content in the above order, and then complete the quizzes.  If there is anything you don't understand, you can always: 

  1. post a question on piazza,
  2. attend the weekly live Q&A sessions and drop-in labs, and/or
  3. ask your tutor and colleagues during your tutorial sessions.

Tutorial 3 - tutorial pack

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