Professional Documents
Culture Documents
Discrete Mathematics Syllabus
Discrete Mathematics Syllabus
Math2051
Discrete Mathematics
Instructor’s Information
Name: Miliyon T.
Email: miliyon@ymail.com
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
Elements of graph theory þ Definition and examples of a graph
þ Matrix representation of a graph
þ Isomorphic graphs
Chapter 3
þ Weighted Graphs
þ Minimal Spanning trees
þ Shortest path problem
þ Critical Path Problem
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%