Fall 1997 Summer 1997 Spring 1997 Fall 1996 Spring 1996 Fall 1995

cs330 - Fall 1997


Students should get familiar with discrete objects and structures. They should also develop their ability to think mathematically.

Sections 01 and 91 Section 02
Instructor Virgil Bistriceanu Camelia Zlatea
Room class meets SB-238 SB-107
Time class meets MW 9:00 am - 10:15 am MW 12:45 pm - 2:00 pm
Office hours MW 8:00 am - 9:00 am
TR 7:00 pm - 9:00 pm
F 8:00 am - 10:00 am
One hour before lecture
Office SB-110 SB-115
Phone (312) 567-5146 (312) 567-5944
Fax (312) 567-5067
e-mail virgil@csam.iit.edu camelia@csam.iit.edu
Teaching Assistant
Name: Rajni Gauni
Office: SB-001A
Office Hours: Tuesday 3:30 pm to 5:30 pm
Phone: (312) 567-5872
e-mail: gaunraj@charlie.iit.edu


"Discrete Mathenmatics"
Richard Johnsonbaugh
Prentice Hall, Inc. 1997
ISBN: 0-13-518242-5


Late homeworks won't be accepted. Everything you have to turn in is due at the beginning of the class the day the work is due.

All the work you submit must be individual. When teamwork is submitted the mark earned is divided by the number of participants.

For late programming assignments there is a 10% per business day penalty.

Exams are closed-book(s) closed-notes.

Grading is based on the following scale:

Class attendance and participation will help settle the borderline grades.

Regular class attendance is important and students are expected to actively participate in class: questions and comments are always welcome.

Important events

Event Sections 01 and 91 Section 02
Midterm October 6, 9:00 am October 6, 12:45 pm
Programming Assignment #1 October 15, 9:00 am October 15, 12:45 pm
Last Day to Withdraw with W October 31
Programming Assignment #2 November 19, 9:00 am November 19, 12:45 pm
Final December 8, 10:30 am to 12:30 pm December 12, 10:30 am to 12:30 pm

The instructors for this class reserve the right to change this schedule.


What Hours
Elementary logic5
Sets, graphs, trees and other structures6
Functions: introduction1
Constructing functions1
Properties of functions2
Counting infinite sets1
Construction techniques4
Elementary counting2
Function growth2
Regular languages and FA6
Number representation4
First-order predicate calculus2
Turing Machines2


Unless otherwise stated all papers you turn in will be TYPED. No handwritten work is accepted. Each page will have a header as follows:

Each page will also have a footer:

The header and the footer will be Arial or Helvetica, 10 points, regular. The text for the paper itself will be typed using Times Roman (12 points regular, except for titles which may be larger and bold).

Click here to see a template.