Section ID: 493523
This web page (http://www-cse.ucsd.edu/classes/wi04/cse105/) will be used to make important announcements related to the course. All class members are responsible for reading information on the web page, and checking it frequently for updates.
This course introduces the basic, formal ideas underlying the notion of computation. Syllabus: finite automata, regular expressions, context-free grammars, pushdown automata, turing machines, decidability, undecidability, the halting problem, introduction to complexity theory.
Here are the problems posed in class and a selection of problems from the textbook. Although your grade will be based exclusively on your performance on the quizzes and final exams, all students are expected to work on the problems listed here. For the problems assigned in class, you are expected to come up with a solution before the next lecture, when the solution to the problem will be usually discussed, or used as a starting point to discuss a new topic.
Give context free grammar for the language Lexists defined above.
|Lectures||Tuesday, Thursday||11:00a-12:20p||Center 214|
|Quiz 1||Tuesday January 27||11:00a-12:20p||Center 214|
|Quiz 2||Thursday February 12||11:00a-12:20p||Center 214|
|Quiz 3||Tuesday March 2||11:00a-12:20p||Center 214|
|Final Exam||Monday, March 15||11:30a-2:29p||Center 214|
Introduction to the Theory of Computation by Mike Sipser, PWS Publishing Co., 1997.
See book website for Errata.
|Instructor||Daniele Micciancio||Tuesday 2-3pm||AP&M firstname.lastname@example.org (*)|
|Honghao Shan||Monday 11am-12pm||AP&M 4859|
|Geoff Romer||Wednesday 1-2pm||EBU-1 6307C|
(*) If you want your messages to be read, you should send them from your ucsd email account in plain text format. Emails sent from external accounts (e.g., hotmail), with no return address, blank body and the message text included as an html attachment, may be automatically deteled by my email spam filter programs and are likely to never reach my email inbox.
Chapter 0: The material covered in this chapter is prerequisite to this course. This material will not be explicitly covered in class, but you are expected to read the chapter to make sure you have the necessary background.
Below are some pointers to where in the textbook you can find the material covered in each lecture. The list is tentative, and will be updated lecture by lecture as the course goes on. The book also contains many excercises and problems at the end of each chapter. You are encouraged to try solve them. That's the best way to test your understanding and problem solving abilities.
Class members are expected to do all of the following in order to satisfactorily pass this class:
Quizzes are scheduled during regular lecture hours, and everybody is expected to attend. There will be no make up quizzes. Not showing up to a quiz will count as 0 grade. Each quiz will account for 20% of the final grade, the final exam gives the remaining 40%. Both the quizes and the final exam will be closed books, closed notes. You can take 1 double sided sheet of notes to the exam, but the notes must be your own.
Grades will NOT be assigned on a curve. You will receive a grade based on your own performance. If everybody does well, everybody will get an A! (Unfortunately, this has never happened so far.) Final grades will be based roughly on the following scale: 50-54 (D), 54-58 (C-), 58-62 (C), 62-66 (C+), 66-70 (B-), 70-75 (B), 75-80 (B+), 80-85 (A-), 85-90 (A), 90-100 (A+)
All students are expected to be familiar with and abide by the rules of UCSD Policy on Integrity of Scholarship as described in the UCSD General Catalog. In case of cheating, such policy will be enforced. This means an F grade in the course, and action by the Dean of your college (probation or suspension from UCSD). You are allowed (and encouraged) to collaborate with other students in doing the homeworks. No form of collaboration is allowed during the quizzes and final exam.