Department of Computer Engineering
CENG 277 Discrete Structures
Fall 2011
Schedule:
Section 1: Tuesday 14:40, 15:40 MHB2-208
Wednesday 12:40 MHB1-B12
Section 2: Wednesday 16:40, 17:40 MHB2-109
Thursday 10:40 MHB1-B12
Instructor: Melih Onus
Office Hours: Monday 14:40 – 16:30, Wednesday 14:40 – 16:30
Office: 213
E-mail: melih@cankaya.edu.tr
Description:
Logic and proofs, Equivalences, Ouantifiers, Sets, Fuctions, Sequences, Algorithms, The Growth of Functions, Induction, Recurrence Relations, Counting, Permutaions and Combinations, Binomial Coefficients, The Pigeonhole Principle, Primes and Greatest Common Divisors, Integers and Algorithms, Applications of Number Theory.
Text Book:
Kenneth H. Rosen. Discrete Mathematics and Its Applications, 6. Edition, 2007, McGraw Hill Education.
References:
Susanna S. Epp. Discrete Mathematics with Applications, 4. Edition, 2010, Brooks Cole.
Grading:
Homework (%15)
Quiz (%15)
Midterm (%30) 15.11.2011 13:40 - 15:30 Muh B3 Z17, Z20
Final (%40) 19.01.2012 12:30 - 14:50 Muh B3 Z17, Z20
Outline:
· The Foundations: Logic And Proofs (1.1 - 1.4, 1.6)
· Basic Structures: Sets, Functions, Sequences and Sums (2.1 – 2.4)
· The Fundamentals: Algorithms, the Integers, and Matrices (3.1 – 3.3)
· Induction and Recursion (4.1 – 4.3)
· Advanced Computing Techniques (7.1 – 7.3)
· Counting (5.1 – 5.5)
· The Fundamentals: Algorithms, the Integers, and Matrices (3.5 – 3.7)
Attendance: You will fail the class it the attendance is below a certain percentage (%70).
Documents: