CSE191: Discrete Structures

Spring 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, Spring 2015: TTh 12:30-1:30p or by appointment.
- This course is now being taught by Andrew Hughes.
- 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 SUNYBuffaloCSE191Spring2015 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.
- Plagarism 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 plagarism and academic integrity.
- It is Departmental policy that recitations do NOT meet during the first week of class.
- Grading & Critical Dates:
  - All graded assignments are ''cummulative.''
  - Readings and book assignments will be given in class.
  - Doing the zyBooks readings and book assignments on time - 10%
  - Quiz I: Thursday, Feb 5 - 10%
  - Exam I: Thursday, Feb 19 - 20%
  - Exam II: Thursday, March 26 - 20%
  - Quiz II: Thursday, April 9 - 10%
  - Final Exam: Thursday, May 14, 8:00a - 11:00a, NSC 201 - 30%
- Teaching Assistants (Office Hours for TAs held in lounge outside of 301 Davis Hall):
  - Wenjun Jiang (wenjunji@buffalo.edu), Office Hours: Tu 11-12N, F 11-12N
  - Sixu Piao (sixupiao@buffalo.edu), Office Hours: M 4-5p, W 11-12N
  - Jerry Chu (jchu6@buffalo.edu), Office Hours: M 3-4p, Th 2-3p
  - Tianle Ma (tianlema@buffalo.edu), Office Hours: Tu 3-4p, Th 4-5p
- Recitations:
  - R1, Tuesday, Norton 210, 8:00a, Wenjun Jiang
  - R2, Wednesday, Norton 209, 12:00N, Sixu Piao
  - R3, Thursday, Norton 213, 3:00p, Jun Chu
  - R4, Friday, Cooke 127A, 4:00p, Wenjun Jiang
  - R5, Monday, Cooke 127B, 5:00p, Sixu Piao
  - R6, Monday, Clemens 17, 9:00a, Tianle Ma
  - R7, Thursday, TBA, 11:00a, Jun Chu
- 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.