CSE191: Discrete Structures

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.

• Office Hours and E-mail
  • Please read Sending E-mail to Faculty before sending me a message by e-mail.
  • Office hours, Dr. Russ Miller, Spring 2016: Hallway after class or Arranged
• 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 BuffaloCSE191Spring2016 and click Subscribe.
    • A visual guide, based on a previous semester, to acquiring the zyBook is available.
    • 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.
    • Text: An efficient and cost-effective way to rent the text is from this Microsite. (Note that the purchase price on this microsite is very high compared to the price in the Bookstore or at Amazon.)
• Important Information
  • Plagiarism in any way, shape, or form, including obtaining an unauthorized copy of the book, 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.
  • 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 last semester are here. 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 listed is updated as we start new sections/chapters.
  • All graded assignments are ''cummulative.''
  • Your grade will be determined as follows:
    • zyBook assignments (all) in 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, February 25 - 25%
    • Mid-Term Exam II: material up through and including the previous lecture. Thursday, April 21 - 25%
    • Final Exam: Thursday, May 12, 8:00-11:00a, Norton 112 - 40%
  • Final Grades
    • A: 75+
    • B: 60+
    • C: 50+
    • D: 35+
    • F: <35
• Reading Timeline
  • Jan 26: Course Overview
  • Jan 28: Start zyBook Chapter 1
  • Feb 4: Start zyBook Chapter 2
  • Feb 9: Start zyBook Chapter 3
  • Feb 11: Start zyBook Chapter 4
  • Feb 16: Start M&B Chapter 2
  • Mar 3: Start M&B Chapter 1
  • Mar 8: Start M&B Chapter 4
  • Apr 26: Start M&B Chapter 5
  • Apr 26: Pages 236-243 in M&B
  • May 3: Chapter 9 overview
  • May 5: Pages 192-196 in M&B
• Class: Tuesdays and Thursdays, 9:30-10:50a, Norton 112
• Recitations (TA - TBA):
  • Mondays, 9:00a, Cooke 127A, Jeremy Topolski
  • Mondays, 10:00a, Norton214, Jeremy Topolski
  • Mondays, 5:00p, Norton214, Qi Li
  • Tuesdays, 8:00a, Norton 214, Zulkar Nine
  • Wednesdays, 8:00a, Park 440, Jeremy Topolski
  • Wednesdays, 9:00a, Cooke 127A, Jeremy Topolski
  • Wednesdays, 12:00a, Hoch 139, Zulkar Nine
  • Thursdays, 3:00p, Norton 210, Qi Li
  • Fridays, 4:00p, Cooke 127A, Qi Li
• Teaching Assistants Office Hours:
  • Jeremy Topolski, 302 Davis Lounge, jetopols@buffalo.edu
    • Mondays: 11a-12N
    • Tuesdays: 2p-5p
    • Wednesdays: 10a-12N
  • Zulkar Nine, Davis 202, mdsqzulk@buffalo.edu
    • Mondays: 3p-5p
    • Tuesdays: 11a-1p
    • Wednesdays: 3p-5p
    • Thursdays: 1p-3p
    • Fridays: 11a-4p
  • Qi Li, Davis 205, qli25@buffalo.edu
    • Mondays: 2p-5p
    • Tuesdays: 2p-5p
    • Wednesdays: 2p-5p
    • Thursdays: 4p-5p
• Learning Outcome (Middle States Accreditation): Ability to understand fundamental principles in the field of Discrete Mathematics.