Introduction to Discrete Structures II
Sections 01 & 02, Fall, 2020
Phone: (732) 445-2001 ext. 3629
Office: Hill 442
(In Fall 2020, Hill 442 will not be used much. To meet with me, contact
me via e-mail to set up a meeting via WebEx.)
Click here for current
Other times by appointment.
Lectures will be presented as scheduled: Tuesdays and Thursdays 1:40-3:00.
They will also be recorded for later use.
Recitations will be held as scheduled: Section 1 Wednesdays 6:55-7:50 PM, and
Section 2 Mondays 6:55-7:50 PM.
Enrolled students will receive announcements via Sakai, regarding how to
connect to WebEx for lectures.
Recitation Instructor: Xiaoxiao (Arist) He (Section 1)
Office Hours: Mondays, noon-1:00 PM
Teaching Assistant: Fei Deng (Section 2)
Office Hours: Fridays, 4:00-5:00 PM
Texts: For the most part, we will use Mathematics for Computer Science by Lehman,
Leighton, and Meyer.
Other recommended (not required) texts include:
S. Ross, A First Course in Probability (need not be the 10th edition; earlier
editions are adequate)
H. Rosen, Discrete Mathematics and its Applications (whatever edition you used
for 198:205, Introduction to Discrete Structures I)
Click here to see notes
on material to be covered.
Click here to find out about homework.
Click here to find out about what was covered in class, and what material you should read next.
Click here to find
recorded videos of the lectures this semester.
Please be aware of our
Departmental Academic Integrity Policy.
Students are expected to maintain the highest level of academic integrity.
You should be familiar with the
university policy on academic integrity. Violations will be reported and
enforced according to this policy.
Use of external website resources such as Chegg.com or others to obtain
solutions to homework assignments, quizzes, or exams is cheating and a
violation of the University Academic Integrity policy. Cheating in the course
may result in grade penalties, disciplinary sanctions or educational
sanctions. Posting homework assignments, or exams, to external sites without
the instructor's permission may be a violation of copyright and may
constitute the facilitation of dishonesty, which may result in the same
penalties as plain cheating.
Students will need to acknowledge the Rutgers Honor Pledge on every major
exam assignment as follows:
On my honor, I have neither received nor given any unauthorized
assistance on this examination/assignment.
ROUGH COURSE OUTLINE
- Review of prerequisites, set theory, countability
- Random experiments, sample spaces, events, probability measures
- Conditional probability, Bayes' Theorem, Independence
- Combinatorics and Counting
- Recurrences, Generating Functions
- Random Variables
- Bernoulli Trials
- Expectation, Variance
- Markov Chains
- Applications of Probability and Combinatorics
- Paths, Components, Connectivity, Euler Paths, Hamiltonian Paths,
Planar Graphs, Trees.
ASSESSMENT and EVALUATION
There will be frequent homework, and several quizzes/small exams.
There will also be a take-home final exam, which will account for roughly
one-fourth of your grade.
Please visit the
Rutgers Student Tech Guide page for resources available to all students.
If you do not have the appropriate technology for financial reasons, please
email Dean of Students email@example.com for assistance. If
you are facing other financial hardships, please visit the
Office of Financial Aid.
Learning remotely presents new challenges. For assistance with learning how
to address these challenges, please consult the resources available