Information list for the course
		        202-1-9301
 	Mathematical Foundations of Computer Science
		        2001/02-A


General information:  This course is basic and generally important.
-------------------   It is one of the keys for studying Computer Science.

Lecturer:	       Prof. Yefim Dinitz
Reception hours:       Tuesday 14.00-15.30, room 302/58, phone 647-7867, box 196
email: 			dinitz@cs.bgu.ac.il

Lectures:		Tuesday   10-12, room 140/90
--------	    and	Thursday  17-19, room 114/32

Exercise instructor:	Lior Malka
Reception hours:	Sunday 16-18, room  -106/58, phone 647-7808, box 48
email: 			liorma@cs.bgu.ac.il

Exercises:		Sunday    18:10-20:00, room 109/34
---------
Home work checker: 	Lior Malka

Home works:  weekly, obligatory, in pairs or single - EXPLANATIONS OBLIGATORY!
----------
	Is given each Tuesday at 12.00 at the lecture.
	Is due the next Tuesday: either at 10.00 to the box of Lior,
	or handed in to the lecturer at 10.10 (not later!).

	     A submission late by k <= 7 days:  minus (3 + k/2) points,
			  late by k  > 7 days:  minus k points.
	     No submissions after returning checked works!

Home work grade = average of the home work grades, except of the worst one
---------------
Final grade = if exam < 56 then  100% exam
-----------	           else   85% exam + 15% home work grade

Exam duration - 3.5 hours.
-------------

Web site of the course: www.cs.bgu.ac.il/~dinitz/Course/MFCS/main.html
----------------------
Recommended textbooks:
---------------------
Main:
   Grimaldi R.P.
   Discrete and Combinatorial Mathematics.
   Addison-Wesley. (in Aranne Library - QA 39.2.G748, #1339718)

Additional:
   Discrete Mathematics.
   Universita Ptuha (in Hebrew), volumes 1-4
   (except for Logics; v.4 is Combinatorics).

Course material in the book of Grimaldi:
---------------------------------------
 	
Combinatorics			1.1 - 1.4,
				8.1, 8.3

Logics				2.1 - 2.3

Math. induction & number theory	4
 (too much detail)

Pigeonhole principle    	5.5

Set theory			3.1 - 3.3  
				5.1 - 5.2	    
				5.3 (the first two pages,
				     with corresponding exersises)
				5.6
				7.1, 7.3, 7.4

Graph theory			11.1 - 11.3
 (too much detail)

Course material at Sigalit (the student secretary of Comp. Sci.), room 9/58
-------------------------- (find the material scanned at  www.bmathp.cjb.net )

1. Combinatorics (handwritten notes, 4 lectures #9-12, in Hebrew)

2. Math. induction & number theory (in less detail than in Grimaldi)

3. Exams of previous t/years + the formula lists.

4. Other.

----------------------------
Last change: 24.10.02