Spring 1997 Fall 1996 Spring 1996 Fall 1995

cs330 - Spring 1997


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

Sections 01 and 91 Section 51
Instructor Alexander Manov Virgil Bistriceanu
Room class meets SB-231 SB-201
Time class meets MWF 10:10 am - 11:00 am M 6:20 pm - 9:10 pm
Office hours MWF 11:00 am - noon
R 5:00 pm - 6:00 pm
M 2:00 pm - 6:00 pm
Office SB-110
Phone (312) 567-5147 (312) 567-5146
Fax (312) 567-5067
e-mail manov@csam.iit.edu virgil@csam.iit.edu
Teaching Assistant
  • Joyce Chen
  • Office hours: Friday 11:00 am - 12:50 pm
  • Room: SB-001
  • Phone: (312) 567-5872
  • email: chenpei@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 51
Midterm 3/3/97, 10:10 am - 11:00 am 3/3/97, 6:20 pm - 7:10 pm
Programming Assignment #1 3/10/97, 10:10 am 3/10/97, 6:20 pm
Programming Assignment #2 5/5/97, 10:10 am 5/5/97, 6:20 pm
Final 5/13/97, 10:10 am - 12:00 noon 5/12/97, 6:20 pm - 8:10 pm

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


What Hours
Sets, graphs, trees and other structures6
Functions: introduction1
Constructing functions1
Properties of functions2
Counting infinite sets1
Construction techniques4
Optimal algorithms1
Elementary counting2
Function growth2
Regular languages and FA6
Number representation4
Elementary logic5
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.