CSE191: Discrete Structures

Fall 2015

Prof. Russ Miller

338 Davis Hall
645-4737 (rarely, if ever, answered)
Read this before sending e-mail to miller@buffalo.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.

Outline of the course (dynamic)
- Pleae read Sending E-mail to Faculty before sending any e-mail.
- Office hours, Dr. Russ Miller, Fall 2015: TTh, 3:30-4:30.
- We will be using an on-line book from zyBooks (zyBooks.com) for this course. In order to access the book,
  - go to zyBooks.com,
  - Enter zyBooks code SUNYBuffaloCSE191Fall2015 and
  - click Subscribe.
  - A visual guide to acquiring the book is available here.
  - If that does not work, please contact support@zybooks.com.
- For the analysis of algorithms portion of the course, I will use material from Algorithms Sequential and Parallel: A Unified Approach. Given that I am experimenting with the zyBooks.com book, please hold off on purchasing this algorithms book until I decide how much I will be using it.
- There will be no programming projects in this class.
- Plagiarism in any way, shape, or form, will earn you an F in the course. 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.
- It is Departmental policy that recitations do NOT meet during the first week of class.
- Grading & Critical Dates:
  - Class attendance is OPTIONAL, with the exception of two exams, when it is required.
  - No Class: Mon, Sept 7; Wed, Sept 23; Wed, Nov 25;
  - Readings and book assignments will be listed on-line.
  - All graded assignments are ''cummulative.''
  - Doing the zyBooks readings and book assignments prior to the start of the final exam - 30%
  - Mid-Term Exam (zybook 1-5; M&B 1,2,4): Friday, Oct 30 - 30%
  - Final Exam: Wednesday, December 16, 11:45a-2:45p Cooke 121 / Knox 110 - 40%
- Recitations (Jeremy Topolski):
  - Tuesday 8:00-8:50a; Capen 262
  - Wednesday 11:00-11:50a; Knox 04
  - Thursday 8:00-8:50a; O'Brian 212
  - Thursday 9:00-9:50a; Clemens 06
  - Thursday 4:00-4:50p; Hoch 139
- Teaching Assistants Office Hours:
  - Jeremy Topolski (302 Davis Lounge)
    - Mondays: 11:00a-Noon
    - Tuesdays: 9:00-11:00a
    - Thursdays: 10:00-11:00a ; 1:00-2:00p
  - Wenjun Jiang (301C Davis Hall)
    - Mondays 3:00-5:00p
    - Tuesdays 12:00-3:00p
    - Wednesdays 3:00-5:00p
    - Thursdays 12:00-3:00p
    - Fridays 1:00-2:00p ; 3:00-4:00p
- Reading Timeline
  - Chapter 1 in zybook completed on Monday, Sept 14
  - Chapter 2 in zybook completed on Wednesday, Sept 16
  - Chapter 3 in zybook completed on Monday, Sept 21
  - Chapter 4 in zybook completed on Monday, Sept 28
  - Chapter 5 in zybook completed on Monday, October 5
  - Chapter 2 in Miller & Boxer completed on Friday, October 9
  - Chapter 1 in Miller & Boxer completed on Friday, October 16
  - Chapter 4 in Miller & Boxer completed on Friday, November 20.
  - Chapter 5 in Miller & Boxer completed on Wednesday, December 2.
  - Pages 236-243 in Miller & Boxer on Friday, December 4.
  - Pages 192-196 in Miller & Boxer on Monday, December 7.
- Learning Outcome (Middle States Accreditation): Ability to understand the fundamental principles of the field of Discrete Mathematics.
I reserve the right to change this syllabus at any time.