This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Introduction Margaret M. Fleck 23 August 2010 This lecture does a brief introduction to the course and reviews adminis- trative matters. 1 Introductions This course is Computer Science 173, Discrete Structures. Introduce myself and any other teaching staff who have been able to come. 2 What is the course about? CS 173 teaches two different sorts of things, woven together. 173 teaches you how to read and write mathematical proofs. It also provides a survey of basic mathematical objects and techniques, useful in later CS courses. These include propositional and predicate logic, sets, functions, relations, modular arithmetic, counting and probability, graphs, and trees. Formal mathematics is relevant to computer science in several ways. First, it is used to create theoretical designs for algorithms and prove that they work correctly. This is especially important for methods that are used frequently and/or in applications where we dont want failures (aircraft design, Pentagon security, ecommerce). Only some people do these designs, but many people use them. The users need to be able to read and understand how the designs work. Second, the skills you learn in doing formal mathematics correspond closely to those required to design and debug programs. Both require keeping track of what types your variables are. Both use inductive and/or recursive 1 design. And both require careful proofreading skills. So what you learn in this class will also help you succeed in practical programming courses....
View Full Document
This note was uploaded on 10/03/2010 for the course CS cs173 taught by Professor Fleck during the Fall '07 term at University of Illinois, Urbana Champaign.
- Fall '07
- Computer Science