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.

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
  • Important Information
  • Grading & Critical Dates:
  • Reading Timeline
  • Class: TTh, 9:30-10:50a, NSC 225

  • Recitations:
  • Personnel

  • 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.

    Copyright © 2017 by Russ Miller.

    All rights reserved. No part of this document may be used in any form by any electronic or mechanical means without permission in writing by the author.