cs330 - Spring 2001


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

Sections 01 and 91
Instructor Virgil Bistriceanu
Room class meets E1-104
Time class meets MW 8:35 am - 09:50 am
Office hours
  • MW 7:00 am - 8:30 am
  • M 8:00 pm - 8:30 pm
  • Other times by appointment only
Office SB-110
Phone (312) 567-5146
Fax (312) 567-5067
e-mail virgil@cs.iit.edu
Teaching Assistant
Name: Xiaoshan He
Office: SB-019
Office Hours: W 1:00 pm - 3:00 pm
Phone: 312-567-5332
e-mail: hexiaos@charlie.iit.edu

"Discrete Mathematics and Its Applications - fourth edition"
Kenneth H. Rosen
McGraw-Hill, 1999
ISBN: 0-07-289905-0
  • Homeworks: 20%
  • Programming Assignments: 30% (15% each)
  • Midterm: 20%
  • Final: 30%

All work you have to turn in is due at the beginning of the class the day the work is due. Late work will be accepted, subject to a penalty of 10% per day, up to the point when solutions are discussed in class or made available to students.

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

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

Grading is based on the following scale:

  • A: 90 - 100
  • B: 80 - 89
  • C: 70 - 79
  • D: 60 - 69
  • E: 0 - 59

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
Midterm February 28, 8:35 am
Spring vacation March 12 to March 15
Programming Assignment #1 due March 21
Last Day to withdraw with assured W March 30
Programming Assignment #2 due April 25
Last day of classes May 4
Final 5/9/2001 between 8am and 10am, E1-104

The instructor(s) for this class reserve the right to change this schedule.


Topic Chapter Hours
Sets, graphs, trees and other structures16
Functions: introduction2.11
Constructing functions2.21
Properties of functions2.32
Counting infinite sets2.41
Construction techniques34
Elementary counting5.22
Function growth5.42
Regular languages and FA116
Number representation-4
Elementary logic65
First-order predicate calculus7.12
Turing Machines13.12


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

  • the left side: your name
  • middle: page number and the total number of pages (ex. 2/5 indicates this is page 2 out of a total of 5)
  • right hand side: name of the assignment (ex. Homework #2)

Each page will also have a footer:

  • the left hand side will contain the following text: cs330-section: Spring 2001 where section stands for the section you are in
  • the right hand side will contain the following text: Illinois Institute of Technology - ComputerScience

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).

Last update: April 30, 2001 Virgil Bistriceanu's home page. The Computer Science home page