### What and When

Sections 01 and 91 meet Monday, Wednesday, Friday from 2:10 pm to 3:00 pm in SB-232

### Goal(s)

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

### Instructor

• Office hours (held in SB-115)
• Monday 8:00 am - 10:00 am
• Wednesday 10:00 am - 02:00 pm
• Friday 10:00 am - 02:00 pm
• Phone: (312) 567-5146
• email: virgil@charlie.iit.edu (from UNIX accounts) IN%"virgil@charlie.iit.edu" (from VAXes)

### Teaching Assistant

Yeong Kim

• Office hours (held in SB-108)
• Tuesday 11:00 am - 12:00 pm
• Thursday 1:00 pm - 2:00 pm
• Phone: (312) 567-5160
• email: kimyeon1@charlie.iit.edu or ykim@kardia.cs.iit.edu

### Textbook

"Discrete Structures, Logic, and Computability"
James L. Hein
Jones and Bartlett Publishers, 1995
ISBN: 0-86720-477-X

• Homeworks: 20%
• Programming assignments: 30%
• Midterm: 20%
• Final: 30%

Late homeworks won't be accepted as solutions are posted immediately after papers are collected.

For late programming assignments there is a 10% per business day penalty.

Everything you have to turn in is due at the beginning of the class the day the work is due.

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

• 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

• Spring break: March 11-16
• Mideterm exam: March 22
• Programming assignment #1 due: March 29
• Programming assignment #2 due: April 26
• Final exam: To be announced

### Tentative Schedule

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

### 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>: Spring 1996 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).