cs330 - Fall 2002
Goal(s)
The objective of the course is to introduce students to discrete structures and methodologies,
with special emphasis on structures applicable to computer science.
Students are expected to gain knowledge of proof methodologies and techniques useful
in the analysis of algorithms.
|
Sections 01 and 91 |
| Instructor |
Virgil Bistriceanu |
| Room class meets |
PH-131 |
| Time class meets |
TR 8:35 am - 09:50 am |
| Office hours |
- TR 7:00 am - 8:00 am
- M 5:30 pm - 5:15 pm
- Other times by appointment only
|
| Office |
SB-214 |
| Phone |
(312) 567-5146 |
| Fax |
(312) 567-5067 |
| e-mail |
virgil@cs.iit.edu |
| Teaching Assistant |
| Name: |
Weizhao Wang |
| Office: |
SB-017 |
| Office Hours: |
TR 11:30am to 1:00pm |
| Phone: |
TBA |
| e-mail: |
wangwei4@iit.edu |
|
Textbook
"Discrete Mathematics and Its Applications - fourth edition"
Kenneth H. Rosen
McGraw-Hill, 1999
ISBN: 0-07-289905-0
Grading
- Homeworks: 20%
- Programming Assignment #1: 15%
- Programming Assignment #2: 15%
- Midterm: 20%
- Final: 30%
All work you have to turn in is due
before the end of the class the day the work is due. Late work will
be accepted, subject to a penalty of 10% per calendar day, up to the point when solutions
are discussed in class or made available to students.
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 |
| Last day to drop a class |
9/7/2002 |
| Midterm |
10/3/2002 |
| Thanksgiving vacation |
11/28-30/2002 |
| Last day for official withdrawal |
11/1/2002 |
| Last day of classes |
12/7/2002 |
| Final |
12/12/2002 from 8:00am to 10:00am in PH-131 |
The instructor of this class reserves the right to change this schedule.
Topics
|
Topic |
Hours |
| 1 |
Introduction: discuss class structure, objectives, and requirements |
1 |
| 2 |
Elementary logic |
3 |
| 3 |
Sets |
3 |
| 4 |
Functions |
3 |
| 5 |
Algorithms |
4 |
| 6 |
Mathematical reasoning |
4 |
| 7 |
Relations |
3 |
| 8 |
Graphs |
3 |
| 9 |
Trees |
3 |
| 10 |
Boolean Algebra |
3 |
| 11 |
Modeling computation |
5 |
| 12 |
Counting: permutations, combinations, discrete probability, pigeonhole principle |
3 |
| 13 |
Advanced counting: inclusion-exclusion, recurrence relations, methods of solving recurrences |
3 |
| 14 |
Midterm |
2 |
| 16 |
Final exam |
2 |
| Total |
45 |
Varia
Unless otherwise stated all papers you turn in will be TYPED. Handwritten
work will be penalized 50%. 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 2002 where section stands for the
section you are in
- the right hand side will contain the following text:
Illinois Institute of Technology - Computer Science
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).
$Id: syllabus.html,v 1.3 2002/09/17 13:22:07 virgil Exp virgil $
|