T Naughton, CS NUIM
Back to CS355 home

[Lab sheet 1 - Programming finite automata] [Quiz] [Quiz sample solution] (05 Oct 2004)
[Lab sheet 2 - Programming finite automata (cont.)] (12 Oct 2004)
[Lab sheet 3 - Regular expressions] [Quiz] [Quiz sample solution] (19 Oct 2004)
[Lab sheet 4 - Nondeterministic finite automata] [Sample solutions] [Quiz] [Quiz sample solution] (02 Nov 2004)
[Lab test 1A] [Lab test 1B] [Sample solutions] (09 Nov 2004)
[Lab tutorial 1 - Regular languages] (16 Nov 2004)
[Lab sheet 5 - Context-free languages] [Quiz] (23 Nov 2004)
[Lab test 2A] [Lab test 2B] [Sample solutions] (30 Nov 2004)
[Lab sheet 6 - Turing machine programming] (30 Nov 2004)
[Lab sheet 7 - Turing machine programming] (07 Dec 2004)
[Lab test 3A] [Lab test 3B] [Sample solutions] (14 Dec 2004)

Class tests from a 2002-2003 course called "CS403 - Computational Complexity Theory:"

[Class test 1] (15 Nov 2002)
[Class test 1 (repeat)] (28 Nov 2002)
[Class test 2] [Solutions] (29 Nov 2002)
[Class test 3] [Solutions] (16 Dec 2002)

Lab sheets from a 2002-2003 course called "SE307 - Computation and Complexity Theory:"

[Lab sheet 1 - Turing machine programming] (26 Sep 2002)
[Lab sheet 2 - TM programming (language acceptance)] (03 Oct 2002)
[Lab sheet 3 - TM programming (language acceptance)] (10 Oct 2002)
[Lab sheet 4 - Machines simulating machines (finite automata)] (17 Oct 2002)
[Test 1] (24 Oct 2002)
[Lab sheet 5 - Machines simulating machines (finite automata)] (7 Nov 2002)
[Lab sheet 6 - Machines simulating machines (finite automata)] (14 Nov 2002)
[Lab sheet 7 - Pushdown automata] (21 Nov 2002)
[Lab sheet 8 - The waiting game] (28 Nov 2002)
[Test 2] [Sample solutions] (29 Nov 2002)
[Lab sheet 9 - Simple solutions to intractable problems] (05 Dec 2002)
[Test 3] [Sample solutions] (12 Dec 2002)
[Lab sheet 10 - Checking solutions to intractable problems] (19 Dec 2002)
[Lab sheet B - Bonus] (19 Dec 2002)