CS 336. Analysis of Programs.

• From the catalog: Proofs of program correctness and a survey of mathematical techniques useful in the analysis and verification of programs. Prerequisite: The following courses, with a grade of at least C in each: CS 315 OR 315H, M 408C OR 408L, AND PHL 313K OR CS 313H.

The textbook: Kenneth H. Rosen, Discrete Mathematics and Its Applications, McGraw-Hill, 6th Edition.

Grades will be based upon homework, tests, and a final.

Here, from the recommended syllabus, are the principal topics to be covered.

• REVIEW: Propositional logic, predicates and quantifiers; sets, set operations; relations, equivalence relations and partial orderings; mathematical induction, recursion. Emphasis should be placed on mathematical reasoning and methods of proof.
• Functions, growth of functions; algorithms and their complexity.
• Program correctness
• Permutations and combinations; trees and graphs.

P. S. The University of Texas has many rules and regulations. It is highly recommend that for all courses at the University of Texas that students be familiar with the General Information Catalog, the Course Catalog, and of course the Course Schedule, which can all be found on-line at http://www.utexas.edu. Also highly recommended is http://cns.utexas.edu/faculty/files/2006CourseworkRoutine.pdf , Dean Laude's memo on Coursework and Routine: Policies, Procedures, and Recommendations.