Math 21:640:237:01 (Discrete Structures)

Math 21:640:237:01 (Discrete Structures)

Professor Feighn

UPDATED: October 19, 2017

OFFICE HOURS: Tuesday, 2:00--3:00PM and Thursday, 8:45--9:45AM, or by appointment, in Smith 318

OFFICE PHONE: 973-353-5335

EMAIL: feighn@rutgers.edu

CLASS TIMES: 11:30AM-12:50PM, Tuesday and Thursday in Engelhard 215

COURSE DESCRIPTION: Sets, relations, functions, graphs, trees, formal expressions, mathematical induction, and some algebraic structures; applications to probability and computer science and enumerative problems in combinatorial analysis. This course covers the fundamental abstract algebraic structures and concepts most often employed in computer science and probability and statistics. The ideas involved are simple, but elegant and useful and the course aims to convey some of the beauty of mathematics as well as its utility. The course integrates theory and practical applications.

PREREQUISITE: 21:640:119 (Basic Calculus), or 21:640:135 (Calculus I), or 21:640:155 (Honors Calculus I).

NOTE: Discrete Structures is required for CS majors. It NOT required for CS minors or IS majors, who can take 21:198:251 Computer Organization instead. Also, Discrete Structures does not count for credit for the math major. Math majors should take 21:640:238 (Foundations) instead.

TEXTBOOK: Discrete Mathematics (8th Edition) by Johnsonbaugh

GRADING:

DEPARTMENT WEB SITE: http://www.ncas.rutgers.edu/math

DEFINITIONS: You will be responsible for the definitions of important terms introduced in this course. A partial list can be found here.

THIS COURSE COVERS THE FOLLOWING CHAPTERS AND SECTIONS (subject to change):