FINAL December 19, 11:15
pm - 1:45 pm JAVITS 111
FINAL includes DISCRETE MATHEMATICS material
covered in detail during the last weeks
of classes: LECTURES 15, 16, Discrete Mathematics BASICS,
and YES/NO Short Questions as published
in sections below. The CONCRETE MATHEMATICS part
of the FINAL covers material
reviewed in LECTURE 17
FINAL consists of 2
PARTS
Part 1 (60pts)
4 CONCRETE MATHEMATICS Problems
(Lecture 17) and
1 DISCRETE MATHEMATICS Problem
(Lecture 16)
In particular, PROBLEMS will cover
1.Convergence of Infinite Sums (Lecture 10 and Midterm 2)
2.Proof of GENERAL SPECTRUM PARTITION THEOREM (Lecture
11a)
3.Number Theory (Lecture 12)
4. Binomial Coefficients - Polynomial argument (Lecture 13)
5.Finite and Infinite Sets (Lecture16)
Part 2 (20pts)
20 YES/NO QUESTIONS from the set of published on
the course web page
FINAL will also have 1
DISCRETE MATHEMATICS Extra
Credit Problem (10pts) (Lecture 15)
FINAL REVIEW Lectures
and all MATERIALS from
classical DISCRETE MATHEMATICS
needed for FINAL are
POSTED
208 New CS Building
phone: (631) 632-8458
e-mail: anita@cs.stonybrook.edu
Professor Anita Wasilewska Office Hours
Short questions via email any time
CONCRETE MATHEMATICS
A Foundation for Computer Science
Graham, Knuth, Patashnik
Addison- Wesley, Second or Third Edition
There will be 2 Midterms, and a Final examination
There also will be assigned sets of
homework problems students must work out and learn
for the tests
The complete solutions to all problems are posted on the
course webpage
The book also contains majority of solutions but they are are
not complete
All tests are CLOSED NOTES and CLOSED
BOOK
If a student is found using notes or a book during a test,
he/she will receive AUTOMATICALLY
0pts for a given test.
There are 6 sets of Homework problem
Not all of them might be covered.
None will be collected or graded.
You will be tested Homework problems dealing with material covered in class.
Some solutions (very short) of homework problems are also in
the text book.
Students are responsible for working out and writing detailed
solutions explaining all steps and methods used, as it
is done in our Lecture Notes. We
will cover some of such detailed solutions in class
ALL of them are POSTED on our web page for you to study and
learn how to write them.
GRADES for Quizzes and Tests will depend on the form, attention to details, and carefulness of your written solutions.
The course will follow the book very closely and in particular we will cover some, or all of the following chapters and subjects
Chapter 1: Recurrent Problems
Chapter 2: Sums
Chapter 3: Integer functions
Chapter 4: Number Theory
Chapter 5: Binomial Coefficients pp 153- 204
Chapter 6: Special numbers pp 243- 264 (reading)
If time allows will cover some chosen
classical topics in Discrete
Mathematics - to be advertised
None of the Homeworks will be collected.
ALL of the Homeworks SOLUTIONS you
need are posted below
HOMEWORK 1, Chapter 1: Problems on pages 17 -20.
Write carefully a detailed solution to problems 2, 6, 7, 8, 9,
11, 12, 14, 15, 16, 19, 18, 20,
write details of pp 12-13 discussion of cyclic properties of
J(n) and the false guess that J(n) = n/2,
write details of pp 15-16 binary solutions to generalized
recurrence.
HOMEWORK 2, Chapter 2 part one: Problems on pages 62-63.
Write and present a detailed solution to problems 5 ,6, 7, 8,
9, 10, 11, 13, 14, 15, 16,
HOMEWORK 2, Chapter 2 part two: Problems on pages 63-66.
Write and present a detailed solution to problems 16, 18, 19,
20, 21, 23, 24, 25, 26, 27, 29, 30, 31.
HOMEWORK 3, Chapter 3: Problems on pages 96- 101.
Write and present a detailed solution to problems 10, 11, 12,
14, 16, 17, 19, 20, 23, 28, 31, 33, 35, 36.
HOMEWORK 4, Chapter 4: Problems on pages 144 - 149.
Write and present a detailed solution to problems 2, 6, 14,
15, 45.
HOMEWORK 5, Chapter 5: Problems on pages 230 - 235.
Write and present a detailed solution to problems 2, 4, 6, 7,
8, 15, 16, 17, 18, 35, 43, 45.
HOMEWORK 6, Discrete Mathematics- some problems posted- more to come