CSE191: Discrete Structures

Spring 2017

Version: 3/30/2017 8:03a

Prof. Russ Miller

338 Davis Hall
645-4737 (rarely, if ever, answered)
Read this before sending e-mail to miller at buffalo dot edu.
http://www.cse.buffalo.edu/faculty/miller/

In this course, we present fundamental material that will be used as the foundation for more advanced courses in computer science and engineering. Topics are expected to include, but are not limited to, recursion, iteration, recurrence relations, asymptotic notation, evaluating resources for algorithms, graphs, logic, sets, and some basic counting theory. CSE 191 is required for computer science and computer engineering majors.

Text Books

Text #1 (required): For the introductory material in this course, we will use an on-line book from zyBooks (zyBooks.com).
- In order to access the book, go to zyBooks.com,
- Enter zyBooks code BUFFALOCSE191MillerSpring2017 and click Subscribe.
- If that does not work, please contact support@zybooks.com.
Text #2 (required): Algorithms Sequential and Parallel: A Unified Approach.
- Note that this is the 3rd Edition of the book. Do not purchase or gain access to, either legally or illegally, the first or second edition of the book. Do not steal (illegally obtain) the third edition of the book. Obtaining any edition of the book without purchase through proper channels is illegal and there are consquences to such actions.

Important Information

Academic Integrity: Plagiarism in any way, shape, or form, including obtaining an unauthorized copy of the book or allowing someone access to view your work, will 1) earn you an F in the course and 2) result in your name being placed in the department and university database of students who have violated such policies. In addition, other sanctions may be sought, including, but not limited to, being dismissed from the university. Feel free to review the departmental policy and university policy on plagiarism and academic integrity.
Lectures may not be recorded. This includes, but is not limited to, video and audio recording.
It is Departmental policy that recitations do not meet during the first week of class.
There will be no programming projects in this class.
Class attendance is optional, with the exception of exams, when it is required.
There will be no makeup exams.
If you have a medical issue, documentation is required.
If you have a conflict with the final exam, you must handle the situation in terms of making arrangements in your other class(es).
Student comments from Spring 2016 are available. These are the anonymous and unedited comments from the end-of-the-semester Student Surveys provided by the university last semester.

Grading & Critical Dates:

No Class on the following dates: TBA
Readings are listed below. This list is updated as we start new sections/chapters.
All graded assignments are ''cummulative.''
Your grade will be determined as follows:
- Required ("optional" sections are not required) zyBook assignments for chapters 1-4: Due by 9:00a on the date of Mid-Term Exam I - 10%
- Mid-Term Exam I: zyBook chapters 1-4. Thursday, March 2, in class - 25%
- Mid-Term Exam II: material up through and including the previous lecture. Thursday, April 27, in class - 25%
- Final Exam: Thursday, May 18, 8:00a - 11:00a, NSC 225 - 40%
Final Grades
- A: 75+
- B: 60+
- C: 50+
- D: 35+
- F: <35

Reading Timeline

Jan 31: Course Overview
Feb 2: Start zyBook Chapter 1 (Logic)
Feb 9: Start zyBook Chapter 2 (Sets)
Feb 14: Start zyBook Chapter 3 (Functions)
Feb 16: Start zyBook Chapter 4 (Induction & Recursion)
Feb 21: Start M&B Chapter 2 (Chapter 2 PPT (as PDF))
March 16: Start M&B Chapter 1
March 30: Start M&B Chapter 4
May 9: Start M&B Chapter 5
May 11: Pages 236-243 in M&B
TBA: Chapter 9 overview
TBA: Pages 192-196 in M&B

Class: TTh, 9:30-10:50a, NSC 225

Recitations:

Mondays, 9:00a, Clemens 322, Kira Ashton
Mondays, 5:00p, Cooke 127A, Kira Ashton
Tuesdays, 8:00a, Norton 210, Ali Sharipov
Wednesdays, 8:00a, Norton 214, Jeremy Topolski
Wednesdays, 9:00a, Norton 210, Jeremy Topolski
Wednesdays, 10:00a, Baldy 110, Jeremy Topolski
Wednesdays, 12:00N, Cooke 248, Jeremy Topolski
Thursdays, 3:00p, Cooke 127A, Evan Walley
Fridays, 4:00p, Cooke 127A, Evan Walley

Personnel

Please read Sending E-mail to Faculty before sending a message by e-mail to the instructor or Teaching Assistants.
Dr. Russ Miller
- Office Hours: TTh, after class, hallway outside NSC 225 & by appointment
T.A.: Jeremy Topolski (e-mail Jeremy)
- Office Hours
  - Tuesday: 12:00N - 2:00p
  - Wednesday: 1:00p - 3:00p
- Location: Davis Lounge
T.A.: Evan Walley (e-mail Evan)
- Office Hours
  - Thursday: 12:00N - 2:00p
  - Friday: 12:00N - 3:00p
- Location: Davis Lounge
T.A.: Kira Ashton(e-mail Kira)
- Office Hours
  - Monday: 12:00N - 1:00p & 3:00p - 4:00p
  - Tuesday: 11:00a - 12:00N & 2:00p - 3:00p
  - Thursday: 2:00p - 3:00p
- Location: Davis Lounge
T.A.: Ali Sharipov(e-mail Ali)
- Office Hours
  - Monday: 1:00p - 3:00p
  - Tuesday: 4:00p - 5:00p
  - Wednesday: 11:00a - 12:00N
  - Thursday: 4:00p - 5:00
  - Friday: 9:00a - 10:00a
- Location: Davis Lounge

Learning Outcome (Middle States Accreditation): Ability to understand fundamental principles in the field of Discrete Mathematics.

I reserve the right to change this syllabus at any time.