CSE 143

Coursework

Getting Help

Check Scores

Other

Meeting times

Reading assignments

10/3 - 10/4 no reading
10/10 - 10/11 Conquest 1-4 Alone 1-2
10/17 - 10/18 Conquest 5-9 Alone 3-4
10/24 - 10/25 Conquest 10-12 Alone 5-6
10/31 - 11/1 Conquest 13-16 Alone 7-8
11/7 - 11/8 Conquest 17-19 Alone 9-10
11/14 - 11/15 Conquest 20-22 Alone 11-12
11/21 - 11/22 Thanksgiving holiday
11/28 - 11/29 Conquest 23-26 Alone 13-14
12/5 - 12/6 Conquest 27 Alone conclusion-epilogue

Automata

We discussed how to make a Finite State Machine and a Turing Machine. I used a program called JFLAP to build these machines: