CSCI 135, Discrete Structures, Spring 2015

Course Overview

Home | Schedule | Assignments

The final exam will be held on Monday 11 May, 11:30am-2pm. It will cover all material covered in the course. You will have 2.5 hours to complete the exam. You will be given a copy of the front and back pages of the Gries & Schneider text containing all the axioms and theorems we have seen. You will also be allowed to bring to the exam one additional page of notes (standard 8.5x11 letter paper, double sided, handwritten or typed). You might want to use this page to augment the theorem sheet with some of the missing theorems (i.e. theorems used in the chapters but not mentioned in the back of the book), some of the "proof techniques" or checklists, reminders for notation and symbols, or perhaps a small selection of example problems and solutions.

K. Walsh
Office: Swords 335
Office Hours: Tues. 3 - 5pm, Thurs. 1-3pm, or by appointment

Lecture times
Tues & Thurs 11:00 - 12:15

Course description
An introduction to discrete structures for computer science. Some topics of study include set theory, proof techniques, relations and functions, Boolean algebra, predicate calculus, combinatorial analysis, graphs, and discrete probability.

There are no prerequisites for this course.

A Logical Approach to Discrete Math, by David Gries and Fred Schneider, First edition, 3rd "corrected" printing.

Course requirements

Exams: There will be one midterm and one final exam on the following dates:
Midterm Exam: Wednesday, March 11, 5-7pm.
Final Exam: To be determined (during scheduled exam week)

Homework: There will be regular homework assignments, approximately one per week. Due dates and assignments will vary depending on how quickly we move. Generally, HWx will be due immediately at the start of the very next class after we have finished discussing Chapter x. All homework must be hand-written in pen or typeset using LaTeX.

Participation: Part of your grade will be based on attendance, volunteering answers in class, and correctly answering (in writing) short review problems that will be given periodically at the beginning of class (to be handed in). You are expected to come to class prepared, which means you should review the lecture notes from the previous class and do the assigned reading before you come to class. Review problems will be based on the previous lecture and/or the assigned reading.

Participation: 10%
Homework: 40%
Midterm exam: 20%
Final exam: 30%

Late Policy The maximum possible score for an assignment will be reduced by 15% for each day or portion of a day that the assignment is turned in late. So the maximum possible score for an assignment turned in up to 24 hours late is 85%, and the maximum possible score for an assignment turned in up to 48 hours late is 70%, and so on. The penalty will be determined when the complete assignment has been received by the instructor, the department administrative assistant, or another faculty member in the Math and Computer Science department. Late work will not be accepted after the graded assignment is returned to the class or after the solutions have been discussed in class.

Collaboration Policy
You are allowed to discuss strategies for solving homework problems with other students, however any work you turn in must be your own work (i.e. you may not simply copy another student's answers and turn them in as your own). In addition you must clearly indicate the names of any students you work with on each assignment.

Attached to each homework you must submit a discussion log indicating whom you worked with, what you discussed, and when you worked together (dates and times).

Please familiarize yourself with the department's policy on academic integrity.