banner

Computation and Formal Systems: CSC 173
Perpetually-updated Syllabus and Schedule

Procrastination is the grave in which opportunity is buried.

--- Dennis Kimbro.

Any fool can drown; that's the easy bit.

--- Pete Goss, Solo sailor

In 2011 our (optional) workshop-style study group will meet in Computer Studies Building 632 at two times:
Monday 7pm,
Thursday 5pm,
Darcey Riley is the facilitator and guru.

The Reading listed for a day should be done BEFORE that day. You might notice that many of the suggested readings in the syllabus are taken from current or former textbooks for CSC 172, 240, and 254. This is no accident and is meant to give you a leg up for later. These texts may also be good alternative and supplementary texts.

BUT the "suggested reading" in the Syllabus and Schedule may not be sufficient, palatable, or accessible, especially in the programming language segments (first week of a module). They're only suggestions: the main thing is that you understand the material. Another resource is the Alternative or Extra Readings page.

The homework, both written exercises and programming exercises, is organized on a weekly basis and described in detail in the 173 Exercises page. It is (usually) "assigned" at the beginning of a week and due at the end of it, but there are several multi-week assignments.

Except for holidays and other exceptions, written exercises are due in hardcopy by the start of the second (Thursday) 173 class of the indicated due week, in the box outside Marty's office (CSB 735). Thus in 2011 the "Written FLAT for Wk. 2" assignment is due by 2pm on 9.15, which is Thursday of the Week of 9.13.

Programming exercises due in Blackboard on the day and time indicated in Blackboard: dates below are approximate. There's a 3-day "late" period on programming assignments, which are usually due on Sundays, so the Tuesday date is appropriate as a "drop dead" deadline.

The syllabus may well be updated as reality intrudes, so be prepared for variations.

Also, we may interrupt the flow every now and then for a midterm exam or three.

Formal Languages and Automata Theory

Week Subject Primary Reading Lecture Notes Ex. Ass't Ex. Due
8.31 C, FLAT Intro Textbook , Nice on C pointers!, C notes Intro, C Language Intro and FA BB Practice submission, Prog. C Week 1 none
9.6 DFAs, NFAs, Scanning Scott, Programming Language Pragmatics, Ch 2 pp 37-94 (e-reserves); Rosen, Discrete Mathematics and its Applications, Ch 12 (e-reserves). FA and RegExps , Scanning Writ. FLAT Wk 2 Prog. C Wk 2 C Week 1
9.13 CFGs, Parsing Blackboard Content FLAT , Scott on Prog. Lang. syntax . CFGs and Parsing Prog. C Wk 3,4 FLAT Wk 3,4 C Wk 2, FLAT Wk 2
9.20 Foundations Mathematical Structures for Computer Science, Gersting Ch 8 pp 558-620, RR e-Reserves (or BB) Language Types none none

Logic

Week Subject Primary Reading Lecture Notes Ex. Ass't Ex. Due
9.27 Prolog Textbook , Scrappy Terse Notes , Prologomena , Probably confusing Cut! oheads, Prolog , Prolog Alternative Not bad overheads from UK. Prog Prolog Wk 1 Prog: C Wk 3-4, Writ FLAT Wk 3-4
10.4 Prop Calc. Russell and Norvig, AI Mod. Appr. , Ch. 7, pp 200-220, RR e-Reserves (or BB) PC text , PC oheads Prop. Calculus, Inference in PC. Prog Prolog Wk 2 , Writ Logic Wk 2 Prog Prolog Wk 1
10.11 Parsing in Prolog Clocksin and Mellish, Chapter 9 Parsing with DCGs in Prolog none per se none
10.18 Pred. Calc. Russell and Norvig, AI Mod. Appr. , Ch. 8, pp 240-257 and Ch. 9, pp 272-294, RR e-Reserves (or BB). FOPC text , FOPC oheads FOL , and FOL Inference Prog Prolog Wk 3-4 , Writ Logic Wk 3 Prolog Wk 2, Logic Wk 2
10.25 Logic Circuits Foundations of Computer Science , Aho and Ullman Ch. 13 pp 699-732, RR e-Reserves (or BB) Circuits Writ Logic Wk 4 Logic Wk 3

Functional Programming

Week Subject Primary Reading Lecture Notes Ex. Ass't Ex. Due
11.1 Scheme Racket (Dr. Scheme) /usr/staff/drracket/ Scheme Prog Scheme Wk 1 Writ Logic Week 4, Prog Prolog Wk 3-4
11.8 Lambda Calculus Lambda Calculus Notes, Brown Ch 1,2. BB course content. e-reserve scan of Turing Award Excerpt, Constraints and N-Queens Abstraction and Application, Conditionals, Pairs, Numbers Writ Lambda Wk 2 Prog Scheme Wk 2 Scheme Wk 1
11.15 Lambda Calculus Lambda Calculus Notes, Brown Ch 3,4 and Russell and Norvig on Search and CSP (chaps 3 and 5), RR e-reserves or BB, Recursion, Arithmetic and Recursion, Types, Structures, Lists Writ Lambda Wk 3A and 3B , Solving N-Queens Scheme Wk 2, Lambda Calc Wk 2

Matrices and Linear Algebra

Week Subject Primary Reading Lecture Notes Ex. Ass't Ex. Due
11.22 Matlab Stormy Attaway's Book Mathworks Tutorials!, and Mathworks Reference, and , UFL Tutorial and also CSC160 Readings and Lectures, plus X11 Forwarding with SSH. Matlab Choose Matlab Project N Queens
11.29 The Matlab Project and Linear Algebra Project Possibilities , and 160 Theory and Applications, the Matrices and Linear Algebra row, readings column. 160 Theory and Applications, the Matrices and Linear Algebra row, lecture notes column. 160 Theory and Applications, the Matrices and Linear Algebra row, Exercises and Projects column. Includes the 'Extra Credit' part. 12/16
12.6 Ray Tracing Ray Casting refl. funcs. Raycasting Project 12/16
12.06 Solving Differential Equations 160 Theory and Applications, the Ordinary Differential Equations row, readings column. Also Programming Segment, Prog. Asst. 5, Monte Carlo Simulation for Pi. 160 Theory and Applications, the Ordinary Differential Equations row, lecture notes column. 160 Theory and Applications, the Ordinary Differential Equations row, Projects column, either Ballistics: Cannon or Ballistics; Baseball 12/16

---
This page is maintained by Deer Boy

Last update: 6/30/11