Scribd
Upload
25 views2 pages

Course Outline For Discrete Mathematics

Uploaded by

dagimnega44
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
25 views2 pages

Course Outline For Discrete Mathematics

Uploaded by

dagimnega44
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Adama Science and Technology University

School of Applied Natural Sciences


Department of Applied Mathematics
Course outline
Course title: Discrete Mathematics
Course code: Math2207
Credit hours: lecture hrs 3: Tutorial hrs 2
Prerequisite: None
Course category: Compulsory
Chapter 1: Elementary counting principles .
1.1 Basic counting principle
1.2 Permutations and combinations
1.3 The inclusion-exclusion principles
1.4 The pigeonhole principle
1.5 The binomial theorem
Chapter 2: Elementary probability theory
2.1 Sample space and events
2.2 Probability of an event
2.3 Conditional probability
2.4 Independent events
2.5 Random variables and expectation
Chapter 3: Recurrence relations and generating functions
3.1 Definition and examples
3.2 Linear recurrence relations with constant coefficient
3.3 Solutions of linear recurrence relation
3.4 Solutions of homogeneous and non-homogeneous recurrence relations
3.5 Basics of generating functions
3.5.1 Solving recurrence relation using generating function.
Chapter 4: Elements of graph theory
4.1 Definition and examples of a graph
4.2 Matrix representation of a graph
4.3 Isomorphic graphs
4.4 Path and connectivity of a graph
4.5 Complete, regular and bipartite graphs
4.6 Eulerian and Hamiltonian graphs
4.7 Trees and forests (Rooted and Binary trees)
4.8 Planar graphs
4.9 Graph coloring
Chapter 5: Directed graphs
5.1 Definition and examples of digraphs
5.2 Matrix representation of digraphs
5.3 Paths and connectivity
Chapter 6: Weighted graphs and their applications
6.1 Weighted Graphs
6.2 Minimal Spanning trees
6.3 Shortest path problem
6.4 Critical Path Problem
Teaching- learning methods
Three contact hours of lectures and two hours of tutorials per week. Students do

1
home assignments.
Assessment methods
- Assignment /quizzes/ 20%
- Mid semester examination 30%
- Final examination 50%

Teaching materials

References:- N. CH SN Iyengar et al, Discrete mathematics, Vikas publishing house


PVTLTD, 2004
- S. Roman, An introduction to discrete mathematics CBS College publishing, 1986
- B. Harris, Graph Theory and its applications, Academic press, 1970
- Iyengar, S. N, Elements of Discrete Mathematics
- Lipschutz, S., Schaum’s outline series, Discrete Mathematics
- Steven Roman, An Introduction to Discrete Mathematics
- Mattson, H.F., Discrete Mathematics with Application
- Oystein Ore, Theory of graphs, American mathematical
Society, 1974

You might also like