Spring 1998 | Fall 1997 | Summer 1997 | Spring 1997 | Fall 1996 | Spring 1996 | Fall 1995 |
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-113 | SB-113 | ||||||||||
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 |
W 2:00 pm - 3:00 pm | ||||||||||
Office | SB-110 | SB-219 | ||||||||||
Phone | (312) 567-5146 | N/A | ||||||||||
Fax | (312) 567-5067 | |||||||||||
virgil@csam.iit.edu | conscon@charlie.cns.iit.edu | |||||||||||
Teaching Assistant |
|
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.
Event | Section 01 | Section 02 |
Midterm | February 23, 9:00 am | TBA |
Programming Assignment #1 | March 11, 9:00 am | TBA |
Spring Vacation | March 16 - 21 | |
Last Day for Official Withdrawal | April 3 | |
Programming Assignment #2 | April 22, 9:00 am | April 22, 12:45 pm |
Semester Ends | May 16 | |
Final | TBA | TBA |
The instructors for this class reserve the right to change this schedule.
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 |
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.