COURSE Math 100 Discrete Mathematics
INSTRUCTOR
E-MAIL
CLASS SCHEDULE
OFFICE AND PHONE
Assos. Prof. Dr. Halil Oruç http://web.deu.edu.tr/halil.oruc/ halil.oruc@deu.edu.tr
Wednesday 08:30-11:20 M202
Wednesday 13:30-16:20 M202
M202
Wednesday 11:30-13:30 by an e-mail appointment
COURSE OBJECTIVES
This course is designed to study and investigate sets, relations, partially ordered sets, logic, algorithms, principles of counting, Boolean Algebra and Graph Theory.
By the end of this course students are expected to
•
Gain enough mathematical thinking maturity to understand logic, discrete and algebraic structures
•
Appreciate how counting finite structures can be challenging
•
Be acquainted with the structure of graphs and apply the ideas to several subjects.
TEXTBOOK
Discrete Mathematics and its Applications , 6 th
edition, (or 5 th
edition is also available)
Kenneth H. Rosen, McGraw-Hill, ISBN-13:978-007-124474-9 or ISBN-10:007-124474-3
(for 5 th
ed. ISBN: 0-07-289905-0) .
FURTHER REFERENCES:
Discrete and Combinatorial Mathematics, An Applied Introduction, 5 th
edition, (6 th
edition is ain preparation) R. P. Grimaldi, Addison-Wesley (1999), ISBN: 0-201-30424-4
Discrete Mathematics for Computer Scientists, 2 nd
edition
J.K. Truss, Addison Wesley, (1999). ISBN: 0-201-36061-6.
Introduction to Graph Theory, 4th edition,
R. J. Wilson, Addison-Wesley Longman Ltd (1996). ISBN 0-582-24993-7
Concrete Mathematics, A Foundation For Computer Science , 2nd edition
R. Graham, D. Knuth and O. Patashnik, Addison-Wesley (1995). ISBN 0-20-155802-5
Introductory Combinatorics 4 th
edition,
R. Brualdi, Prentic Hall New Jersey, (2004). ISBN: 0-13-100119-1
Discrete Mathematics ,
N.L. Biggs, Clarendon Press (2002) ISBN 0198507178.
1

I recommend you have the textbook and choose one more book in the references.
WEB FOR THE COURSE:
Textbook’s web source http://www.mhhe.com/math/advmath/rosen/r5/info/index.html
My own web http://web.deu.edu.tr/halil.oruc/ is a rich source for the past quizzes, exams, final exam as well as their answers.
COURSE GRADING
Course grades will be based on a weighted composite of performance evaluations in several areas:
Two Midterm Exams 2 x 25%
Class participation
Final Exam
10%
40%
PERCENT GRADE LETTER
90-100 4.0 AA
85-89 3.5 AB
80-84 3.0 BB
75-79 2.5 BC
70-74 2.0 CC
65-69 1.5 CD
60-64 1.0 DD
50-59 0.5 DF
49 and below 0.0 FF
COURSE OUTLINE
26.09
03.10
10.10
17.10
24.10
31-10
07.11
14.11
1
2
3.1-3.3
3.4,3.7
4.1-4.2
4.3-4.4
5.1-5.5
7.1-7.3
TOPIC
Logic and proofs
Sets and functions, method of proofs
Growth of functions, algorithms and complexity
Integers and applications to number theory
Sequences, summations and induction
Recursive definitions and algorithms
Counting, permutations, combinations and binomial and multinomial coefficients
Solving recurrence relations, divide and conquer algorithms
28.11
05.12
12-12
8.1-8.2,8.5
3.8, 8.3
3.8 conquer algorithms
Relations, equivalence relations
Representing relations, Matrices, Boolean product
Matrix operations (some not in the book)
2

19.12 9.1-9.6,
9.7,9.8
26.12 9.1-9.6,
9.7,9.8
Graphs, connectivity, Euler and Hamiltonian paths
Shortest paths, Planar graphs Trees, spanning trees
QUIZZES -ASSIGMENTS
Each section of text book has plenty of exercises. Some will be solved in the class and those that are not solved in the class will be given as assignments. You are strongly encouraged to solve by yourselves. “ Mathematics is learnt by only doing and created by ideas ”.
RULES FOR ATTENDANCE: Attendance is an essential requirement of this course and is the responsibility of the student. Class begins promptly and you are expected to be present at the beginning and at the end of each class session.
HOMEWORK POLICY: Homework problems are the best preparation for exams. You should try to work the homework problems without constant reference to the text or passively receiving help from others. I encourage to discuss problems with others, but you should try to do the actual problems yourself. If you have gotten the idea about how to solve a problem from another person or by looking things up in the text, try to do a related problem without outside aid.
•
The content of this syllabus can be changed by the instructor at any time by informing the related department’s head
•
The student is supposed to be aware of the facts and notices written in this syllabus.
•
The content of this syllabus can be changed by the instructor at any time by informing the related department’s head
•
The student is supposed to be aware of the facts and notices written in this syllabus.
3