Scribd
Upload
233 views2 pages

Discrete Mathematics Syllabus

This document provides information about the Discrete Mathematics course taught by instructor Miliyon T. at Mizan-Tepi University. The course is 3 credit hours and introduces students to discrete mathematics concepts like counting principles, recurrence relations, and graph theory. It will be assessed through assignments, quizzes, tests, and a final exam. The textbook is Discrete Mathematics And Its Applications by Kenneth H. Rosen.

Uploaded by

Miliyon Tilahun
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
233 views2 pages

Discrete Mathematics Syllabus

This document provides information about the Discrete Mathematics course taught by instructor Miliyon T. at Mizan-Tepi University. The course is 3 credit hours and introduces students to discrete mathematics concepts like counting principles, recurrence relations, and graph theory. It will be assessed through assignments, quizzes, tests, and a final exam. The textbook is Discrete Mathematics And Its Applications by Kenneth H. Rosen.

Uploaded by

Miliyon Tilahun
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

Mizan-Tepi University

Math2051
Discrete Mathematics
Instructor’s Information

Name: Miliyon T.
Email: [email protected]
Office No: 201 (Block 202)
Office Hours: TBD

Course Description: This course deals with review of sets and functions, fundamental principles
of Counting and recurrence relations, graph theory and its application.
Prerequisite(s): None.
Credit Hours: 3 hrs

Course Objectives:
On completion of the course, successful students will be able to:

1. know basic concepts of discrete mathematics,


2. understand the principles of counting and recurrence relations
3. understand the basic concepts of graph and their types,
4. know the basic algorithms on graphs,
5. use the methods and principles of Combinatorics,
6. apply Combinatorics in counting problems,
7. solve simple counting problems,
8. construct graphs with given degree patterns,
9. apply graph theory to solve network oriented problems
Course Outline:
Chapter Content
counting principles

þ Basic counting principle


Elementary
Chapter 1

þ Permutations and combinations


þ The inclusion-exclusion principles
þ The pigeonhole principle
þ The Binomial Theorem
Recurrence relations
Chapter 2

þ Definition and examples


þ Linear recurrence relations with constant coefficient
þ Solutions of linear recurrence relations
þ Solutions of homogeneous and nonhomogeneous recurrence relations

1
Elements of graph theory þ Definition and examples of a graph
þ Matrix representation of a graph
þ Isomorphic graphs
Chapter 3

þ Path and connectivity of a graph


þ Complete, regular and bipartite graphs
þ Eulerian and Hamiltonian graphs
þ Trees and forests
þ Planar graphs
þ Graph coloring
Directed graphs
Chapter 4

þ Definition and examples of digraphs


þ Matrix representation of digraphs
þ Paths and connectivity
Weighted graphs &
their applications
Chapter 5

þ Weighted Graphs
þ Minimal Spanning trees
þ Shortest path problem
þ Critical Path Problem

Text(s): Discrete Mathematics And Its Applications. 7th Edition.


Author(s): Kenneth H. Rosen

References:
1. V. K. Balakrishnan, Schaum’s outline of theory and problems of combinatorics including concepts of
graph theory, 1995.
2. Lipschutz S., Lipson M., Schaum’s outline of discrete mathematics, 3rd ed, MGH, 2007.
Assessment:
Assignments 20%
Quizzes 10%
Tests 20%
Final Exam 50%

You might also like