1 / 12

Computational Structures

This course, CS 311: Computational Structures, is taught at Portland State University in two sections led by Tim Sheard and James Hook. The class covers key topics including finite automata, pushdown automata, and Turing machines, with a focus on discrete structures and computability. Each section has specific contact details for instructors and a designated teaching assistant. Students are expected to adhere to academic integrity policies and submit independent work. Course materials include "Discrete Structures, Logic, and Computability" by James L. Hein.

naida-charles
Télécharger la présentation

Computational Structures

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Computational Structures Tim Sheard & James Hook Portland State University Class Preliminaries

  2. Two Sections • This class is taught in two sections • CRN 11043 Tue & Thur 10:00-11:50 BHB 222 • CRN 14577 Tue & Thur 14:00-15:50 FAB 40-07 • Each section has a different instructor • Tim Sheard. Tue & Thur 10:00-11:50 • James Hook. Tue & Thur 14:00-15:50

  3. Contact Details: • Tim Sheard: • Office: Fourth Ave Building (FAB) 120-04 • Telephone: (503) 725-2410 • Email: sheard@cs.pdx.edu • James Hook • Office: Engineering Building (EB) 502E • Office: Fourth Ave Building (FAB) 120-05 • Telephone: (503) 725-5540, (503) 725-5166 • Email: hook@cecs.pdx.edu • Office Hours: Monday, 3 – 5pm, EB 502E • CS 311: • http://web.cecs.pdx.edu/~sheard/course/CS311/index.html

  4. Teaching assistant: • Long Mai • Email mai.t.long88@gmail.com • Office hours: TBA • Further arrangements to be made as the class progresses.

  5. Exams • Midterm: • Most probably Tuesday, October 30, 2012 • Final: • Tuesday December 4, 2012, 10:15-12:05 (Sheard) • Monday December 3, 2012, 10:15-12:05 (Hook)

  6. Methods of assessment:

  7. Policies: • By default, all deadlines are firm. • We will be as flexible as possible in accommodating special circumstances; but advance notice will make this a lot easier.

  8. Academic Integrity • We follow the standard PSU guidelines for academic integrity Students are expected to be honest in their academic dealings. Dishonesty is dealt with severely. • Examinations. Notes and such, • only as the instructor allows. • Homework.. • Discussion is good; • Items turned in should be your own • individual work. You are encouraged • to talk to other people about the • homework problems, but you must write • up your answers independently. If • you're stuck with a problem, • please ask for help.

  9. Course Text: • Discrete Stuctures, Logic, and Computability • (3rded) • James L. Hein • Published by Jones and Bartlett • ISBN-13 978-0-7637-7206-2 • ISBN-10 0-7637-7206-2 • Home page of the text book: • http://www.jblearning.com/catalog/9780763772062/

  10. It looks like this!

  11. Syllabus • Mathematical Preliminaries • (.5 week, review) • Finite Automata and Regular Languages • (3.5 weeks, chapter 11) • Pushdown Automata and Context-Free Languages • (2.5 weeks, chapter 12) • Turing Machines and Undecidability • (2.5 weeks, chapter 13)

  12. Prerequisites - Self Exam • Review Readings • Sets 1.1, 1.2 • Strings 1.3.3, 3.1.2, 3.2.2 • Logic 6.1, 6.2, 6.3, 7.1 • Proofs 4.4 • You should know this review material

More Related