cmpe220-2005-3 bingöl
			Cummulative Topics Covered
mt 1 Nov 18, 2005	mt 2 Dec 23, 2005	final	Discrete Mathematics and Its Applications
			Kenneth H. Rosen, AT&T Laboratories
			Table of Contents
			Preface  vii
			The Companion Web Site  xvii
			To the Student  xix
			1. The Foundations: Logic, Sets, and Functions  1
1			1.1 Logic  1
1			1.2 Propositional Equivalences  20
1			1.3 Predicates and Quantifiers  28
			1.4 Nested Quantifiers  44
1			1.5 Methods of proof  56
1			1.6 Sets  77
1			1.7 Set Operations  86
1			1.8 Functions  97
			End of Chapter Material  111
			2 The Fundamentals: Algorithms, the Integers, and Matrices  119
			2.1 Algorithms  120
			2.2 The Growth of Functions  131
			2.3 Complexity of Algorithms  144
1			2.4 The Integers and Division  153
1			2.5 Integers and Algorithms  169
			2.6 Applications of Number Theory  181
			2.7 Matrices  196
			End of Chapter Material  206
			3 Mathematical Reasoning, Induction, and Recursion  213
		f	3.1 Art and Strategy of Proof  214
		f	3.2 Sequences and Sums  225
		f	3.3 Mathematical Induction  238
		f	3.4 Recursive Definitions and Structural Definition  256
			3.5 Recursive Algorithms  274
			3.6 Program Correctness  284
			End of Chapter Material  290
			4 Counting  301
		f	4.1 The Basics of Counting  301
		f	4.2 The Pigeonhole Principle  313
		f	4.3 Permutations and Combinations  320
			4.4 Binomial Coefficients  327
			4.5 Generalized Permutations and Combinations  335
			4.6 Generating Permutations and Combinations  344
			End of Chapter Material  349
			5 Discrete Probability  355
			5.1 An Introduction to Discrete Probability  355
			5.2 Probability Theory  362
			5.3 Expected Value and Variance  379
			End of Chapter Material  394
			6 Advanced Counting Techniques  401
		f	6.1 Recurrence Relations  401
		f	6.2 Solving Recurrence Relations  413
			6.3 Divide-and-Conquer Relations  425
			6.4 Generating Functions  435
		f	6.5 Inclusion-Exclusion  451
		f	6.6 Applications of Inclusion-Exclusion  457
			End of Chapter Material  465
			7 Relations  471
1			7.1 Relations and Their Properties  471
			7.2 n-ary Relations and Their Applications  482
1			7.3 Representing Relations  489
1			7.4 Closures of Relations  496
1			7.5 Equivalence Relations  507
	2		7.6 Partial Orderings  516
	2		Lattice
			End of Chapter Material  530
			8 Graphs  537
	2		8.1 Introduction to Graphs  537
	2		8.2 Graph Terminology  545
	2		8.3 Representing Graphs and Graph Isomorphism  557
	2		8.4 Connectivity  567
	2		8.5 Euler and Hamilton Paths  577
	2		8.6 Shortest Path Problems  593
	2		8.7 Planar Graphs  603
	2		8.8 Graph Coloring  613
			End of Chapter Material  622
			9 Trees  631
	2		9.1 Introduction to Trees  631
			9.2 Applications of Trees  644
			9.3 Tree Traversal  660
	2		9.4 Spanning Trees  674
	2		9.5 Minimum Spanning Trees  688
			End of Chapter Material  694
			10 Boolean Algebra  701
			10.1 Boolean Functions   701
			10.2 Representing Boolean Functions   709
			10.3 Logic Gates   712
			10.4 Minimization of Circuits
			End of Chapter Material  694
			11 Modeling Computation  739
			11.1 Languages and Grammars  739
			11.2 Finite-State Machines with Output  751
			11.3 Finite-State Machines with No Output  758
			11.4 Language Recognition  765
			11.5 Turing Machines  775
			End of Chapter Material  783
			Appendixes
			A-1 Exponential and Logarithmic Functions
			A-4 Pseudocode
			B-1 Suggested Readings
			S-1 Answers to Odd-Numbered Exercises
			C-1 Photo Credits
			I-1 Index of Biographies
			I-2 Index
			Algebraic Structures (not in text book)
	2		Semigroup
	2		Monoid
	2		Group
	2		Ring
	2		Field
			Compatibility Relation
		Notlar
			- 1 ile işaretlenenler dönem başından midterm #1 ye kadar işlenen konular.
			- 2 ile işaretlenenler midterm #1 ile midterm #2 arasında işlenen konular.
			- f+D31 ile işaretlenenler midterm #2 ile final arasında işlenen konular.