Search


CS 171 Home Page



Discrete Structures II



Spring 2008


This course continues the study of discrete mathematics which was begun in CS 170. The mathematical and theoretical foundations of computer science are emphasized. Topics to be covered include proofs of program correctness, running time anaylsis, computability theory (using Turing machines and the like), complexity theory, grammars & parsing, and counting techniques (especially recurrence relations and generating functions). Optional topics might be added as time allows, such as the connection between Prolog and predicate logic (e.g. the resolution principle). In spite of the emphasis on theory, practical applications are also brought out (such as the use of this theory in creating parsers and compilers).

Further Information

Examples and Class Materials

Instructor: Br. David Carlson





Maintained by: Br. David Carlson
Last updated: June 02, 2008
Disclaimer