	Computer Laboratory Mathematics for Computation Theory: Past Questions

Computer Laboratory > Course material 2002-03 > Mathematics for Computation Theory: Past Questions

Home | Teaching | Past papers index

Mathematics for Computation Theory
2002-03

Principal lecturer:

km@cl.cam.ac.uk

Taken by:

Part II (General)

Past Tripos and Diploma questions

Part A:
Relations on sets (including equivalence relations and transitive closure):

1988 Paper 6 Question 9 [Mathematical Tripos Part IA]

1990 Paper 1 Question 11 [Computer Science Tripos Part IA]
1993 Paper 2 Question 3 [Computer Science Tripos Part IA]

1989 Paper 11 Question 7
1990 Paper 12 Question 4
1993 Paper 10 Question 11
1998 Paper 10 Question 10
1999 Paper 10 Question 10

Partially ordered sets:

1989 Paper 1 Question 11 [Computer Science Tripos Part IA]
1992 Paper 2 Question 3 [Computer Science Tripos Part IA]
1996 Paper 1 Question 7 [Computer Science Tripos Part IA]
1997 Paper 1 Question 7 [Computer Science Tripos Part IA]

1991 Paper 10 Question 8
2000 Paper 10 Question 10

Well-founded relations and Induction:

1988 Paper 6 Question 10 [Mathematical Tripos Part IA]

1989 Paper 12 Question 8
1992 Paper 11 Question 8
1997 Paper 10 Question 9
2001 Paper 10 Question 11

Part B:
Regular Languages and Finite Automata:

1995 Paper 2 Question 27 [Computer Science Tripos Part IA]

1989 Paper 13 Question 11
1991 Paper 11 Question 6
1992 Paper 11 Question 9
1996 Paper 10 Question 9
1996 Paper 11 Question 8
1997 Paper 11 Question 8
1998 Paper 10 Question 10
1998 Paper 11 Question 8
1999 Paper 11 Question 8
2000 Paper 11 Question 8
2001 Paper 11 Question 7



© 2002 Ken Moody Please send any comments to km@cl.cam.ac.uk Page last updated on 2-Dec-2002 at 15:49 by Ken Moody