SILLABUS
	Mathematical Foundation of Computer Science
			202-1-930-1

1. Basic combinatorics (up to the inclusion-exclusion principle)
   - 16 hours.

2. Logics:
   Proposition Calculus, logical equivalence and logical inference.
   - 12 hours.

3. (i)   Mathematical induction.
   (ii)  Integers (proofs and algorithms), up to the decomosition to primes 
	 and algorithm of Euclidus, with bounds for the number of its steps.
   (iii) Pigeonhole principle.
   -  8 hours.

4. Set theory, including functions and relations,
   with the representation of a relation by a graph, 
   up to algorithms of extending a partial order to a total order.
   - 16 hours.


The course textbook:
---------------------
   Grimaldi R.P.
   Discrete and Combinatorial Mathematics.
   Addison-Wesley. (in Aranne Library - QA 39.2.G748, #1339718)

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

2) Material of the course at Sigalit.


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)