**WARNING:** This website is currently under
construction, as the course is being transitioned from CISC 1100
by itself to a course that's cross-listed with CISC 1400. You
should currently take nothing here to be 100% accurate. When this
warning goes away, the website should be more-or-less okay.

**Faculty:**
Dr. A. G.
Werschulz

**Office:** Rm 815D.

**Phone:** (212) 636-6325

**Office Hours:** Mon, Tue, Wed, Thu: Noon to
1:00.

**Class meetings:** in Room 912, four times a
week (Mon, Tue, Wed, Thu), June 5 through 29.

**Class email list:** ```
structures-cs STRUDEL
dsm.fordham.edu
```

(`STRUDEL`

is a
thinly-disguised `@`

, to thwart the amount of spam
that your instructor receives in his guise of list manager). This
can be used for both announcements and discussion.

Lyons *et al.*,
*Fundamentals of Discrete Structures* (Second Edition, 2012).
This book has a (currently rudimentary)
website.
You'll probably be most interested in the
errata
sheet contained therein.

An introductory course in the discrete structures used in computer science and information technology. Emphasis will be placed on the ability to solve problems and develop logical thinking. Topics such as sets, functions, elementary combinatorics, discrete probability, logic, Boolean algebra, recursion and graphs will be covered through the use of algorithmic and concrete construction. The learned materials are reinforced by computer laboratory assignments. This course fulfills the mathematical reasoning requirement for Fordham's core curriculum.

This course covers basic materials in discrete structure and algorithms, which are used in computing science, information technology, and telecommunications. Topics include sets, permutation/combinations, functions/relations/graphs, sum/limit/partition, logic and induction, recursion/recurrence relation, systems of equations and matrices, graphs/digraphs/networks, searching and sorting algorithms, database structure, and data analysis. Practical examples of applications will be shown and programming will be used to reinforce understanding of the concepts.

- Sequences and sets
- Logic
- Relations
- Functions
- Counting
- Probability
- Algorithms (definite for CISC 1400, and as time permits for CISC 1100)
- Graph theory (definite for CISC 1400, and as time permits for CISC 1100)

Learning is an interactive process that begins in the class
room, continues at home, and picks up back in the classroom.
Attendance is necessary to accomplish the objectives of this
course. Over the summer this is of even greater importance, since
there are only fifteen class meetings. *You are limited to four
excused absences.* Additional absences or unexcused absences
will result in a marked decrease in your final grade.

- There will be one midterm examination, which will be held on Monday, June 19, during the first part of the regular class period.
- The final exam (which is on Thursday, June 29, during
the regular class period) is somewhat cumulative:
- You won't be able to answer questions about material appearing later in the course if you don't understand material that appeared earlier in the course.
- I reserve the right to put questions involving this earlier part of the course on the final exam (especially if I felt that there was some topic from the first part of the course that people didn't understand).

There will be homework assigned nearly every day, which will be posted on the class website. Homework will be due at the next class session. I will mightily endeavor to return the graded homework sets at the next class session after that one.

We will be working on two large multi-part projects during the course. One will cover web development, and the other will be an introduction to computer programming.

No prior knowledge is expected but these are projects that you will need to spend time on outside of the class in addition to any in-class time that I provide. This requires that you have access to a computer and the Internet during these times. If you do not there are several places on campus that are suitable to complete this work. Please speak with me if you think there will be a problem.

- Participation: 10%
- Homework: 30%

For CISC 1100, this will be equally weighted between written homework and computer projects. - Midterm exam: 30%
- Final exam: 30%

A student failing both exams cannot pass the course. Additionally, failing to complete computer projects by deadlines set by the instructor can and will cause a reduction to the individual's final grade.

- Feel free to download the class syllabus.
- Academic integrity policy
- Makeup exam policy
- You are not allowed to use computers during the class lectures; they may only be used during the lab sessions (when you will be using the Departmental computers in Room LL812 or the computers in our classroom). In addition, all phones must be turned off before the lecture begins.
- PDF "handout-style" versions of the overhead slides for the course will be made available.
- If you believe that you have a disabling condition that may interfere with your ability to participate in the activities, coursework, or assessment of the object of this course, you may be entitled to accommodations. If so, please schedule an appointment to speak with me immediately or you may go to the Office of Disability Services (LL207, x6282). Under the Americans with Disabilities Act and Section 504 of the Vocational Rehabilitation Act of 1973, all students, with or without disabilities, are entitled to equal access to the programs and activities of Fordham University.

Last modified: Sun May 21 18:02:13 2017