Syllabus

Course Lecture Plan (Tentative)

	Topics	Textbook sections (reading)	Lecture notes	Supplementary assignments
Logic, Sets	logic, proposition, quantifiers	1.1, 1.2, 1.3	Chap1.1, Chap1.2, Chap1.3	a digital circuit application
	set & its operations	1.6, 1,7	Chap1.6, Chap1.7
Functions, Complexity of Algorithms	functions	1.8	Chap1.8	algorithm complexity analysis
	the growth of functions	2.2	Chap2.2
	algorithm & its complexity	2.1, 2.3	Chap2.3
Proof Methods	method of proof	1.5	Chap1.5	proof of a computational algorithm
	mathematical inductions	3.3	Chap3.3
Recursive	recursive definition & algorithms	3.4, 3.5	Chap3.4, Chap3.5	a recursive application
	solving recurrence relations	6.2	Chap6.2
Counting Theory	the basics of counting	4.1	Chap4.1	a counting application
	permutations, combinations and binomial theorem	4.3, 4.4	Chap4.3
Relations	relations and their properties	7.1	Chap7.1
	n-ary relations and their applications	7.2
	representing relations	7.3	Chap7.3
Graphs	Intro and terminology	8.1, 8.2	Chap8.1	application of graph theory
	representing graphs, graph isomorphism and connectivity	8.3, 8.4	Chap8.3
	shortest-path problems	8.5, 8.6	Chap8.5
Boolean Algebra	Boolean functions	10.1, 10.2	Chap10.1, Chap10.2
	logic gates and minimization of circuits	10.3, 10.4	Chap10.3