Course Information

Course Name	Turkish	Ayrık Matematik
	English	Discrete Mathematics
Course Code	BLG 112	Credit	Lecture (hour/week)	Recitation (hour/week)	Laboratory (hour/week)
Semester	2	3	3	-	-
Course Language		English
Course Coordinator		Ayşegül Yayımlı Hayri Turgut Uyar
Course Objectives		To teach basic mathematical structures and methods needed for computer engineering studies. To develop mathematical modelling and abstract thinking skills. To introduce the importance and applications of formal systems.
Course Description		Counting. Propositions, rules of inference, predicates, quantifiers, sets. Proof methods, proof by contradiction, induction. Relations, functions, pigeonhole principle. Graphs, trees. Algebraic structures, partially-ordered sets, lattices.
Course Outcomes		Students can examine an existing simple system formally. Students know the necessary inference rules and proof methods for constructing a mathematically valid proof. Students know the applications of relations and functions and can apply them to problems they have encountered. Students know the basic problems and solutions in graph theory and can apply them to problems they have encountered.
Pre-requisite(s)
Required Facilities
Other
Textbook		Ralph P. Grimaldi, "Discrete and Combinatorial Mathematics", Addison-Wesley, 2004, ISBN 9780321211033.
Other References		John O'Donnell, Cordelia Hall, Rex Page, "Discrete Mathematics Using a Computer", Springer, 2006. ISBN 978-1-84628-2 (available to ITU through SpringerLink).

Courses

Help

About