Each student is required to prepare and present one lecture (between 50 and 75 minutes, including questions) on a topic relevant to the theory of computing. You will need to read some relevant background material from books and journal papers, and present the key points to the class, with illustrative examples, where appropriate. The topic of your presentation should be selected from the list below and confirmed with me on or before Feb. 19, 2002. I will be able to provide some starting points for your literature review. Since each of these areas is sufficiently large to fill several lectures, you should discuss your planned approach to the area with me in advance of preparing your presentation.
Presentations will be in the normal class time starting on March 19, 2002.
|03.19||An Zhiwei||Alternative models of computation (one or more of timed automata, hybrid automata, neural networks).|
|03.21||Atiq Awan||Software testing and reliability|
|03.26||Fang Yang||Parallel complexity theory|
|03.28||Pradeep Bobby||Probabilistic algorithms|
|04.02||Kelda Farrell||Verification of modules/classes|
|04.04||Todd Engram||Object-oriented software design and analysis|
Last modified: Fri 2002.02.15 at 14:01 NST by Dennis Peters