BAHIR DAR UNIVERSITY
INSTITUTE OF TECHNOLOGY
COURSE GUIDE BOOK
Course Title Discrete Mathematics and Combinatory
Course Code Math2041
Instructor Nigussie Chane
ECTS Credits 5CP
Contact hours Lecture Tutorial Lab Home Study
3 2 0
Target Group nd
2 year Software Engineering Students
Semester I
Course type Compulsory
Course Description
Topics include Mathematical logic, set theory, relations and functions, fundamental principles of counting,
principle of Inclusion-Exclusion, recurrence relation, and introduction to graph theory.
Course Objective:- At the end of this course the students will be able to:
• Illustrate by examples the basic terminology of functions, relations, sets, graph theory, Trees
and demonstrate knowledge of their associated operations.
• Learn various counting methods to solve complex problems.
• Demonstrate in practical applications the use of basic counting principles of permutations,
combinations, inclusion/exclusion principle and the pigeonhole principle.
• Establish and solve recurrence relations that arise in counting problems
▪ Illustrate by example basic terminology of graph theory and model problems in computer
science using graphs and trees
Content Week Method Reference
Chapter 1: Introductory logic (8hrs)
1.1 Logical connectives Lecture Ralph P.Grimaldi pages 47-54
1.2 Tautology, contradiction and Question & Ralph P.Grimaldi pages 55-66
logical equivalence Week 1 answer
1.3 Quantified propositions Ralph P.Grimaldi pages 103-111
1.4 Argument and validity Lecture Ralph P.Grimaldi pages 86-102
Week 2 Group discussion
1.5 Methods of Proof
& reflection
Tutorial Work sheet I
Chapter 2: Set theory (10 hrs)
2.1 Introduction about set Lecture Ralph P.Grimaldi pages123-135
2.2 Set operations Week 3 Question&answer Ralph P.Grimaldi pages136-148
2.3 Relations and functions Lecture Ralph P.Grimaldi pages248-267
Week 4
2.4 Equivalence relations Group discussion Ralph P.Grimaldi pages366-370
1
2.5 Partially ordered sets Ralph P.Grimaldi pages356-366
Tutorial Week 5 Group discussion Worksheet II
Chapter 3: Counting Methods (10hrs)
3.1 Introduction Week 7 Lecture Ralph P.Grimaldi pages 1-5
3.2 Permutations Ralph P.Grimaldi pages 6-13
3.3 Combinations Question & Ralph P.Grimaldi pages14-36
Week 8
3.4 Binomial Theorem answer
3.5 Pigeon hole principle Lecture Ralph P.Grimaldi pages273-277
Tutorial Week 9 Group discussion Worksheet III
Chapter 4: Advanced counting methods (8 hrs)
4.1 Inclusion-exclusion principle Lecture Ralph P.Grimaldi pages 385-397
Week Group discussion
4.2 Recurrence relations 10 Ralph P.Grimaldi pages447-480
4.3 Methods of solving recurrence Question &
relations Week answer
Tutorial 11 Worksheet IV
Chapter 5: Introduction to graph theory (10 hrs)
5.1 Definition of graph Week Lecture Ralph P.Grimaldi pages 513-530
5.2 Matrix representation of graphs 12 Question & Acharjya, pages 193-197
5.3 Paths, connectivity, Planar Graphs answer Acharjya, pages 186-191
5.4 Trees Lecture Ralph P.Grimaldi pages 581-587
Week
5.5 Minimum spanning trees Group discussion
14
Tutorial Ralph P.Grimaldi pages 638-643
Week Lecture Ralph P.Grimaldi pages631 -637
15 Worksheet V
Assessments:
Group Individual Mid exam. Final exam. Total
Assignment Assignment
10% 10% 30% 50% 100%
REFERENCE BOOKS
1. Grimaldi, R.P. Discrete And Combinatorial Mathematics: an applied introductory, Addison-Wesley
publishing company, Inc, 1994, US America
2. Biswal, P.C., Discrete Mathematics & Graph Theory, Printice Hall of India PVT LTD, 2005, New Delhi
3. Fundamental approach to Discrete Mathematics, DP. Acharjya, Sreekumar
4. Discrete mathematics and its Application, Keneth H Rosen
5. Discrete mathematics, KEVIN FERLANDP
