Scribd
Upload
117 views2 pages

Discrete Course Outline

This document provides information about a Discrete Mathematics and Combinatorics course offered at Addis Ababa University. The 3 credit, 3 contact hour course is intended to provide students with background in sets, functions, counting principles, recurrence relations, and graph theory for application in probability and networks. Over 5 chapters, topics covered include counting, permutations and combinations, recurrence relations, graph definitions and representations, and weighted graphs and their applications. Assessment is based on assignments, midterm and final exams.

Uploaded by

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

Discrete Course Outline

This document provides information about a Discrete Mathematics and Combinatorics course offered at Addis Ababa University. The 3 credit, 3 contact hour course is intended to provide students with background in sets, functions, counting principles, recurrence relations, and graph theory for application in probability and networks. Over 5 chapters, topics covered include counting, permutations and combinations, recurrence relations, graph definitions and representations, and weighted graphs and their applications. Assessment is based on assignments, midterm and final exams.

Uploaded by

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

ADDIS ABABA UNVERSITY

DEPARTMENT OF MATHEMATICS
Discrete Mathematics and Combinatory
Course Code: Math 2231
Credit Hours: 3 Contact hrs: 3 Tutorial hrs: 2
Prerequisite(s): None Program: Regular
Course category: Compulsory Academic Year: 2022 /2023
Semester: I
Aims
The course sets the necessary background for students to understand the subsequent application
area courses such as probability, network, etc,
Course Description
This course deals with review of sets and functions, fundamental principles of counting,
generating functions and recurrence relations, graph theory and its application.
Course Objectives
On completion of the course, successful students will be able to:
- know basic concepts of discrete mathematics,
- understand the principles of counting, recurrence relations and
generating function
- understand the basic concepts of graph and their types,
- know the basic algorithms on graphs,
- use the methods and principles of Combinatorics,
- apply Combinatorics in counting problems,
- solve simple counting problems,
- construct graphs with given degree patterns,
- apply graph theory to solve network oriented problems,
Course Outline
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: Recurrence relations


2.1 Definition and examples
2.2 Linear recurrence relations with constant coefficient
2.3 Solutions of linear recurrence relations
2.4 Solutions of homogeneous and nonhomogeneous recurrence relations

1|2
Chapter 3: Elements of graph theory
3.1 Definition and examples of a graph
3.2 Matrix representation of a graph
3.3 Isomorphic graphs
3.4 Path and connectivity of a graph
3.5 Complete, regular and bipartite graphs
3.6 Eulerian and Hamiltonian graphs
3.7 Trees and forests (Rooted and Binary trees)
3.8 Planar graphs
3.9 Graph coloring

Chapter 4: Directed graphs


4.1 Definition and examples of digraphs
4.2 Matrix representation of digraphs
4.3 Paths and connectivity

Chapter 5: Weighted graphs and their applications


5.1 Weighted Graphs
5.2 Minimal Spanning trees
5.3 Shortest path problem
5.4 Critical Path Problem

Teaching- learning methods


Three contact hours of lectures and two hours of tutorials per week. Students do home
assignments.
Assessment methods
 Assignments/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

2|2

You might also like