4  CS 135 Goals and assessment

To assess student progress we focus on key skills that can be demonstrated. Here is the official list of course outcomes to be achieved by the end of the semester:

Formal logic

- Unfold a definition, apply a theorem, use deductive rules, for example in proving that a given relation is a function or a function is injective.

Relations

- Define basic properties of relations such as transitivity and injectivity, in words and using logical formulas.

Scheme

- Implement recursive functions on lists, such as append or reverse. For relations represented by lists of pairs, implement operations such as transposition and intersection.

Induction

- Use induction and equational reasoning to prove equations about recursive functions, such as associativity of append.

Modular arithmetic

- Simplify expressions by using laws of modular arithmetic.

Primes

- Define basic properties such as relative primality. Implement Euclid’s algorithm in Scheme.

The list can also be found here