CTE105 - Discrete Mathematics
2012 - 2013 Fall

Department of Computer and Instructional Technology Teacher Education
(Last updated: 08/10/2009)   (CWPS ver: 2.0.2)
Instructors: Hülya Yavuz
E-mail: halil@ctp.bilkent.edu.tr
Grading:     Grades
    Quizzes:   20%
    Midterm 1:   35%
    Final:   45%


The aim of this course is to develop logical reasoning ability of students.Elements of logic, set theory and operations on sets; DeMorgan's rules, finite and infinite. Relations and functions. Logic circuits. Induction and recursion, pigeonhole principle. Permutations, combinations and probability of discrete events. Graphs and their representation in computing.
Credit: 3 credits.
Lecture Hours: 4 hours in a week.

1. To understand the operations on sets and their properties.
2. To apply the operations and principles on sets in solving problems.
3. To understand relations, their properties, equivalence & order relation
4. To understand basic notions of function, special types of function & their properties
5. To use relation, function & their properties in solving problems.
6. To understand the fundamental concepts of logic.
7. To understand the principle of mathematical induction, recursion, & pigeonhole principle.
8. To solve problems by using permutations andcombination.
9.To find the probability of discrete events.
10.To understand graphs and their representations.
11. To understand theory of trees, routed trees, tree traversals, and some applications.
Textbooks and Other Materials:
  • Required: "Discrete Mathematics, 7th ed.", Richard Johnsonbaugh, 2009, ISBN: 978-0-13-135430-2
  • Recommended: "Discrete Mathematical Structures, 6th Ed.", Kolman, Busby, Ross, 2009, ISBN: 978-0-13-207845-0
  • Recommended: "Discrete Mathematics and Its Applications, 6th Ed.", Kenneth Rosen, 2007, ISBN: 978-007-124474-9
  • Recommended: "Discrete Mathematics for Computer Science", J.L.Mott,A. Kandel & T.P. Baker
  • Recommended: "Discrete Mathematics", Melvin Hausner
  • Exercises-1  
    End of CTE105 main page.