CS370 - Computation and Complexity
Department of Computer Science, NUIM
Lab Sheets and Lab Tests
T Naughton, CS NUIM
Back to CS370 home
Academic year 2005-2006
[Lab sheet 1 - Turing machine programming] [Sample solutions] (4 Oct 2005)
[Lab sheet 2 - Turing machine programming (cont.)] (11 Oct 2005)
[Lab sheet 3 - Turing machine programming (cont.)] (18 Oct 2005)
[Lab sheet 4 - Decidable languages] (8 Nov 2005)
[Lab test 1 - Turing machines] [Sample solutions] [Grades] (15 Nov 2005)
[Lab sheet 5 - Undecidable Turing-recognisable languages] (22 Nov 2005)
[Repeat lab - finish lab sheet 5] (29 Nov 2005)
[Lab test 2 - Undecidability and complexity measurement ] [Sample solutions] [Grades] (6 Dec 2005)
[Lab sheet 6 - NP problems ] (13 Dec 2005)
Academic year 2003-2004
Click here to find out if you are in Group A or Group B.
[Lab sheet 1 - Turing machine programming] [Sample solutions] (7 Oct 2003)
[Lab sheet 2 - Turing machine programming (cont.)] (14 Oct 2003)
[Lab sheet 3 - Countable and uncountable sets - Group A] [Sample solutions ] (21 Oct 2003)
[Lab sheet 3 - Countable and uncountable sets - Group B] [Sample solutions ] (4 Nov 2003)
[Lab sheet 4 - Decidability and undecidability - Group B] [Sample solutions ] (11 Nov 2003)
[Lab sheet 4 - Decidability and undecidability - Group A] [Sample solutions ] (18 Nov 2003)
[Lab test 1 - Groups A and B] (25 Nov 2003)
[Lab sheet 5 - Groups A and B] [Sample solutions] (2 Dec 2003)
[Lab sheet 6 - Groups A and B] [Sample solutions] (9 Dec 2003)
[Lab test 2 - Groups A and B ] [Sample solutions
] (16 Dec 2003)