LECTURE: M,T,W,Th
INSTRUCTOR:
Dr. Pante STANICA, 251A Spanagel, 656-2714,
pstanica@nps.edu,
http://www.nps.navy.mil/Faculty/stanica/index.htm
OFFICE HOURS: M,T,W,Th
(Be aware that office hours are not a
substitute for regular class time)
TEXT:
Introductory Combinatorics (3rd� ed.); by Richard A. Brualdi 1999.
CALCULATOR POLICY: Using a
CAS like Mathematica or Maple can give more insight
but it is not required.
MATERIAL TO BE
COVERED (and Objectives for the course—subject to be adjusted
along the way):
We shall attempt to cover some selected sections of: Chapter 1 through 8, and
Chapters 10 &13.
HOMEWORK: You are encouraged to do as many problems as you can from the book. However the standard (default) assignment for each week is to read carefully the indicated sections and to prepare for homework the problems I will assign in class. The homework will not be collected. However, the exams may contain problems from the assigned homework.
TESTS: One take-home midterm will be given in Week 5 or 6 (to be returned one week later) and a final comprehensive take-home exam (to be returned one week later, as well). Both the midterm and the final exam will contain approx. 10-20 prob/que (each of the prob/que will be worth 5-10 points for a total of 60 points for the midterm and 100 points for the final). No make-up tests will be given except in extraordinary circumstances (e.g. illness - present verified doctor's excuse). I reserve the right to give in-class pop quizzes (1-5pts), which will be used toward the final grade, as an add-on (extra credit) to the final score. If the test dates will be changed I will announce it in class at least one week in advance. It is your responsibility to stay informed of such changes. Each student will study and give at least one in-class presentation (of one of the topics/sections of the book). It could spread in more than one session. I shall assign periodically such sections. The presentation(s) are worth 40 points.
GRADING:
The number of possible points is 200 (quizzes could push this over). For the
letter grade I will use the following scale (be advised that class
participation will be considered, especially in the borderline grades) (there
are no exceptions from this scale!!!!):
185-200: A
175-185: A-
170-174: B+
160-169: B
150-159: B-
140-149: C+
130-139: C
125-129: C-
120-124: D+ �
095-119: D
000-094: failing grade.
An unresolved absence from either of the two tests or the final examination
will result in a final grade of “FA”.
ACADEMIC HONESTY: Cheating in this course will not be tolerated and will be dealt with as harshly as the University permits. I will report any student behavior that appears contrary to the standards of discipline and academic honesty or violations of the provisions described in the current edition of NPS Student's Catalog.
CLASS ATTENDANCE
AND ENVIRONMENT: You should do every attempt to arrive on
time and attend each class. You are responsible for the material covered in
missed classes. I do not tolerate any rude behavior; however, I encourage
constructive comments on the material and/or lecture. We have to maintain a
class environment conducive to learning therefore I am against bringing
“active” cell phones, pagers, and other similar disruptive devices
into the classroom.
NOTES:
*Advanced techniques in enumerative combinatorics
and an introduction to combinatorial structures. Topics include generating
functions, recurrence relations, elements of Ramsey theory, theorems of
Burnside and Polya, and balanced incomplete block
designs. Application areas with DoD/DoN relevance
range from mathematics to computer science and operations research, including
applications in probability, game theory, network design, coding theory, and
experimental design.
*It is a bit of material to be covered, so do not fall behind.
* If it is necessary, there will be
updates of this handout. Make sure you check my homepage regularly for info on
the course (that is work in progress).
* Good Luck !
I hope you will all make good grades!