CS 1155: Understanding and Constructing Proofs

Spring 1999 Sections A & B


General Description

Basic techniques of rigorous argumentation emphasizing the reading and writing of formal and informal proofs in discrete mathematics and computer science.

Instructor

H. Venkateswaran (Venkat)
CoC 236, (404) 894-3658, email: venkat@cc.gatech.edu
Office hours: MW 3pm-4pm and by appointment.

Teaching Assistants

Section A [newsgroup] B [newsgroup]
TA
Thomas Patrick Browne
Tobie Tennille Jones
Qirong Li
Q. Alex Zhao
Office Hours T Th 2:30-4pm MW 2-3pm MW 1-2pm T Th 1:30-2:30pm
Location CoC 226E CoC 1st Floor Commons Area or Baird Computer Cluster CoC 1st Floor Commons Area or Baird Computer Cluster CoC 226B

Text

K. A. Ross and C.R.B. Wright, Discrete Mathematics.

Grading

8 homework assignments 30%
3 quizzes 15%
1 midterm examination 20%
1 final examination 35%

Guidelines on Homeworks

You may discuss your work with other students in the class. But, do not share answers. Write your own answers. If you discussed your work with other students, you must mention the names of students with whom you collaborated. Home-works are due at the beginning of class. Late home-works will be assessed a penalty of 20% for each day. Home-works will not be accepted after 72 hours.

Other Useful Information

Course Outline

  1. Sets and functions. (Chapter 1)
  2. Infinite sets. (Chapter 11).
  3. Propositional calculus. (Chapter 2)
  4. Relations. (Chapter 3)
  5. Mathematical induction, Recurrence relations. (Chapter 4)
  6. Boolean Algebras and Boolean expressions. (Chapter 9)
  7. Partially ordered sets, Closures of Relations. (Chapter 10)

Homework Solutions

Get Acrobat Reader
# Due Assignment Sample Solutions
1 4/9 PDF PDF
2 4/16 PDF PDF
3 4/30 PDF PDF
4 5/7 PDF PDF
5 5/14 PDF PDF
6 5/21 PDF PDF
7 5/28 PDF PDF
8 6/4 PDF PDF

New: Quiz 3 solution.


Other classes