CS 205M, Theoretical Foundations of Computer Science (Minor Course)

Autumn 2014 - 2015

Instructors

Purandar Bhaduri, ext: 2360 (email: pbhaduri)

Teaching Assistants

1. Lalaltendu Behera (email:  lalatendu)
2. Ramanuj Chouksey (email: r.chouksey)

Textbook

Computation Engineering: Applied Automata Theory and Logic, Ganesh Gopalakrishnan, Springer, Indian reprint 2009. The book is available online almost in entirety.

The errata for the book is available from the author's website.

Lecture Notes

Lecture notes from the course CS 3100 at Utah are available from the author's website.

Additional Material

1. Notes on Set Theory for Computer Science by Glynn Winskel.

Evaluation

Assignments 15%

Midsem                                            35%

Endsem 50%

Midsem Exam Solutions

Homework

1. (Due Date 18/08, Monday) Exercises 2.4, 2.6, 2.8, 2.9 and 2.10 from Winskel's notes (pages 27 - 29).

2. (Due Date 25/08, Monday) Exercises 2.16, 2.17 (i), 2.18, 3.1 (i) and (ii), 3.5 and 3.11 from Winskel's notes (pages 40 - 47).

3. (Due Date 01/09, Monday) Exercises  3.15, 3.17, 3.34, 3.38 and 3.42 from Winskel's notes (pages 49 - 59).

4. (Due Date 08/09, Monday) Exercises  7.11, 7.12, 7.13, 7.14 and 7.16 from the textbook (page 117).

5. (Due Date 15/09, Monday) Exercises  8.3, 8.5, 8.15, 8.16 and 9.7 from the textbook (pages 130 - 131, 158).

6. (Due Date 20/10, Monday) HW # 6

7. (Due Date 03/11, Monday) Exercise 14.5 parts (4) and (5) from the textbook (page 269).

8. (Due Date 10/11, Monday) HW # 8

Homework Policy

Late assignments would be penalised by deducting (10 × no. of days of lateness) % of the marks. Any form of copying will incur zero marks.

back to homepage