cs330 - Fall 1998

Goal(s)

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

Section 01

Section 02

Instructor

Virgil Bistriceanu

Constantinos Constantinides

Room class meets

SB-231

TBA

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
M 8:00 pm - 9:00 pm
R 8:00 pm - 9:00 pm

TBA

Office

SB-110

TBA

Phone

(312) 567-5146

N/A

Fax

(312) 567-5067

e-mail

virgil@csam.iit.edu

conscon@charlie.cns.iit.edu

Teaching Assistant

Name:	Khaled Alzoubi
Office:	SB-017
Office Hours:	W 11:00 am - 12:30 pm
Phone:	N/A
e-mail:	`alzokha@charlie.iit.edu`

Textbook

"Discrete Structures, Logic, and Computability"

James L. Hein

Jones and Bartlett Publishers, 1995

ISBN: 0-86720-477-X

Grading

Homeworks: 20%
Programming assignments: 30% (15% each).
Midterm: 20%
Final: 30%

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:

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	Section 01
Midterm	September 28, 9:00 am
Programming Assignment #1	October 7, 9:00 am
Last Day to withdraw with assured W	October 31
Programming Assignment #2	November 9, 9:00 am
Semester Ends	December 4
Final	TBA

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

Topics

What	Chapter	Hours
Sets, graphs, trees and other structures	1	6
Functions: introduction	2.1	1
Constructing functions	2.2	1
Properties of functions	2.3	2
Counting infinite sets	2.4	1
Construction techniques	3	4
Induction	4.4	2
Algorithms	5.1	1
Elementary counting	5.2	2
Function growth	5.4	2
Regular languages and FA	11	6
Number representation	-	4
Elementary logic	6	5
First-order predicate calculus	7.1	2
Turing Machines	13.1	2
Total		41

Varia

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: Fall 1998 where section stands for the section you are in
the right hand side will contain the following text: Illinois Institute of Technology - CSAM

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