CS 336 Analysis of Programs

S 2008

Instructor: Dr. Maggie Myers myers@cs.utexas.edu

Office hours:

Office: PAI 5.48 Phone: 471-9533

TA:

Office Hours:

We hope this class is instructive and worthwhile for you. If during the semester you have any suggestions for how the TA or I can improve the course, please let us know.

Text: Discrete Mathematics and its Applications, Kenneth H. Rosen. (6^th edition) The text is a reference and will be supplemented.

Grading: Two 100 pt exams, a comprehensive final worth 120 pts, and an 80 pt. Quiz/homework grade combine for a possible 400 pts. No curve!

360-400 A

320-359 B

280-319 C

240-279 D

Below 240 F

Homework: Homework will be assigned and collected on Tuesdays. Homework (5 points each) will be found on Blackboard. There will be quizzes (5pts each) consisting of problems from the homework. Sample exams (5points) will be collected. Top 16 scores will be used for Quiz/homework grade. No MAKEUPS on quizzes!!!! On very, very rare occasions with excused absence, makeup exams may be arranged.

Study groups: Please organize yourselves into study groups to discuss the course. The ideal model to follow is first to work independently, then to discuss issues with your fellow students, and then to prepare the final write-up.

Attendance, attention, and open-mindedness: Mandatory.

Topics:

Preliminaries/Review

Predicate calculus with an emphasis on manipulation

How to write proofs

Proofs of program correctness

Assertions and Hoare triples

Weakest Preconditions

Axioms for sequential composition, assignment, and branching

Verification of loop-free programs

Loops and invariants

Total correctness

Developing loops from invariants and bounds

Developing invariants

Mathematical techniques for the analysis of programs

Induction and Recursion

Recursive Definitions

Mathematical induction

Well-ordering principle

Recurrence relations

Combinatorics

Pigeon Hole principle

Permutations and combinations

Inclusion-exclusion principle

Big-Oh

Graph Theory