CSC 360 - Formal Languages and Computability I

An introduction to theoretical computer science. Topics include regular expression and finite state concepts; basic automata theory; formal grammar and languages; computability; Turing machines; elementary recursive function theory.

TEXTBOOKS

Languages and Machines by Thomas A. Sudkamp Addison Wesley Publications. Third Edition
Douglas R. Hofstadter, Gödel, Escher, Bach: An Eternal Golden Braid, Any edition is fine, but here's one: Basic Books, 1999, ISBN: 0-465-02656-7.

GRADING

This course will require substantial pencil-and-paper problem-solving but very little programming outside of class.  

• Exams: There will be 2 midterm exams each worth 15% of your grade (30% total). 
• Final Exam: The final exam is comprehensive and worth 20% of your grade.
• Quizzes: There will be (almost) weekly quizzes worth 10% of your grade.  Your 1 lowest quiz grade will be dropped.
• Homework: Your homework grade is worth 40% of your course grade.  All homework assignments are mandatory.  You will receive an 'F' in the course if you fail to submit a homework assignment within 5 days of the due date.    For each day a homework assignment is late, 10 points will be subtracted from that assignment's grade.  You may discuss assignments with each other but you are required to independently write up your own solutions. Copying and team collaboration is prohibited.

• Course Grade
  A modified 10-point scale will be used to compute your course grade. Pluses and minuses ( + ) will be assigned solely at the discretion of the instructor.  Factors that affect this judgment are the distribution of grades, improvement during the semester, and attendance.
   

  90 - 100 A

  80 - 89 B

  70 - 79 C

  60 - 69 D

Honor Code

It is the responsibility of every student to follow the UNCW Academic Honor Code (see Section V of your Student Handbook). You violate the honor code when you represent someone else's work as your own. Individual programming assignments may be discussed at a conceptual (i.e. design and algorithms) level with other students but implementation details and coding must be your own. Team programming assignments must be completed without collaboration with other teams. Copying of programs is prohibited and will result in disciplinary action (see your Student Handbook). Copying includes digital copies, hand copies, as well as representing a slight modification of someone else's code as your own work.

Learning Strategies

You are expected to take an active role in your learning in this course. This includes regular attendance, paying attention in class, reading the textbook, and completing all course requirements. You are encouraged to study with your classmates outside of class.

Students with Disabilities

If you have a disability and need reasonable accommodation in this course, you should inform the instructor of this fact in writing within the first week of class or as soon as possible. If you have not already done so, you must register with the Office of Disability Services in Westside Hall (extension 3746) and obtain a copy of your Accommodation Letter. You should then meet with your instructor to make mutually agreeable arrangements based on the recommendations of the Accommodation Letter.