with your topic choice. When I confirm your choice, you have chosen your topic.
Projects for CS605 practical work week
The project for the week of practical work is a report-based project. Each student must choose a topic that has been covered in the lectures and write a 5-10 page report on that topic.
Students must submit a report that has been prepared in the form of a self-learning aid for computer theory students. In order to hit the right level with technical details, imagine you are writing for your former self, as you were at the beginning of the course --- equally intelligent as you are now but less knowledgeable in computer theory. You may assume that the reader knows some basics; just list them at the beginning of your report. (For example, you could say "We assume that the reader knows what a graph is.")
No two students will be allowed to choose the same topic. The chosen topics to date are:
Wei Zhang "An introduction to Turing machines"
Xindong Zhou "Introduction to pushdown automata"
Colm Harrington "Time complexity"
Silvian Dragan "FAs, NFAs, and regular languages"
Justin Shine "Decidabilty and the halting problem"
Shun Hao "An introduction to the pumping lemma"
Philip Curtis "Introduction to regular expressions"
Ciara Dunne "A brief history of computer science"
Al Grogan "Comparison of the relative time and space complexities of DFAs and NFAs"
Sinéad Redmond "P, NP and NP-complete problems with a particular emphasis on the TSP problem"
How do I choose a topic?
with your topic choice. When I confirm your choice, you have chosen your topic.
How will the report be marked?
before 23:59h on Friday 7th October 2011 will be marked, unless alternative arrangements have been agreed with me in advance. Part-time students have until 23:59h on Sunday 23th October 2011. The report must be in PDF format, or in PS format. I will acknowledge receipt of your report within one working day.