Scribd
Upload
182 views2 pages

Discrete Mathematics For CS (2015)

This document provides information about a course titled "Discrete Mathematics and Combinatory" offered at Wachemo University. The course is a 3-credit, junior-level course offered in the Department of Mathematics. It aims to provide students with a strong background in combinatorics and graph theory. Topics covered include counting principles, recurrence relations, graph theory, directed graphs, and applications of graphs. Assessment methods include assignments, quizzes, midterm and final exams. The course will be delivered through lectures, group work, and problem solving.

Uploaded by

Desyilal
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
182 views2 pages

Discrete Mathematics For CS (2015)

This document provides information about a course titled "Discrete Mathematics and Combinatory" offered at Wachemo University. The course is a 3-credit, junior-level course offered in the Department of Mathematics. It aims to provide students with a strong background in combinatorics and graph theory. Topics covered include counting principles, recurrence relations, graph theory, directed graphs, and applications of graphs. Assessment methods include assignments, quizzes, midterm and final exams. The course will be delivered through lectures, group work, and problem solving.

Uploaded by

Desyilal
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

Wachemo University

College of Natural and Computational Sciences

Department of Mathematics

Course title: Discrete Mathematics and Combinatory

Course code: Math 2051 Credit hours: 3 (ECTS 5) Contact hrs.: 3 Tutorial hrs.: 2
Year: II Semester: I Academic Yr.: 2022/2023

Course description

The course is designed to prepare students to have a strong background in combinatory and graph
theory for successful accomplishment of their field of study. This course rigorously discusses the
basic concepts of elementary counting principles, recurrence relations, elements of graph theory,
directed graphs, weighted graphs, matrix representations of graphs and directed graphs, and
application of graphs.

Course objectives

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

 Identify the elementary counting  Understand the terms digraph, labelled


principle. digraph, unlabelled digraph, vertex,
 Solve counting problems using a arc, adjacent, incident, multiple arcs,
counting method. loop, simple digraph, underlying graph
 Identify the difference between the and sub-digraph;
permutation and combination of a  Write down the adjacency matrix and
counting method. incidence matrix of a given labelled
 Define recurrence relation. graph or digraph;
 Solve linear homogeneous recurrence  Draw the graph or digraph with a
relation with constant coefficient. given adjacency or incidence matrix;
 Solve linear nonhomogeneous  Use the shortest path algorithm to
recurrence relation with constant find the shortest path between two
coefficient. vertices of a weighted graph or
 Introduce some basic definitions and digraph;
concepts of graph theory.  Use graph colouring to schedule
 Apply the concept of graph theory to examinations;
the real world.
Course outline

Chapter 1: Elementary counting principles (9 hrs.)

1.1. Basic counting principle 1.4. The pigeonhole principle


1.2. Permutations and combination 1.5. The binomial theorem
1.3. The inclusion-exclusion principles
Chapter 2: Recurrence relations (9 hrs.)

2.1. Definition and examples


2.2. Linear recurrence relations with constant coefficient
2.3. Solutions of linear recurrence relations
2.3.1. Solving linear homogeneous recurrence relation with constant coefficient
2.3.2. Solving linear nonhomogeneous recurrence relation with constant coefficient

Page 1 of 2
Chapter 3: Elements of graph theory (10 hrs.)

3.1. Definition and examples of a graph 3.5. Eulerian and Hamiltonian graphs
3.2. Isomorphic graphs 3.6. Tree Graphs
3.3. Path and connectivity of a graph 3.7. Planar graphs
3.4. Complete, regular and bipartite graphs 3.8. Graph colouring
Chapter 4: Directed graphs (6 hrs.)

4.1. Definition and examples of digraphs 4.2. Paths and connectivity


Chapter 5: Matrices and Graphs (4 hrs.)

5.1. Adjacency Matrices 5.2. Incidence Matrices


Chapter 6: Application of Graphs (10 hrs.)

6.1. Weighted Graphs 6.3. Shortest path problem


6.2. Minimal spanning trees 6.4. Critical path problem
Mode of Course Delivery (Teaching Methodology): Lecture, gaped lecture, question and
answer, pair work, group discussion, problem solving and individual work.
Methods of Assessment: Assignments/ quizzes/ tests(20%), Mid-Exam(30%) and Final
Examination(50%).
Teaching materials

Text Books & References:

Mattson, H. F. (1993). Discrete mathematics with applications. John Wiley & Sons, Inc.

Roman, S. A. (1986). An introduction to Discrete mathematics. Saunders College Publishing.

Rosen, K. H., & Krithivasan, K. (2012). Discrete mathematics and its applications: with
combinatorics and graph theory. Tata McGraw-Hill Education.

References:

Epp, S. S. (2010). Discrete mathematics with applications. Cengage learning.

Harris, B. (1970).Graph Theory and its applications. Academic press.

Iyengar, S.N. (2004). Discrete mathematics. Vikas publishing house PVT LTD.

Lipschutz, S. (2016). Schaum's Outlines of Theory and Problems of Discrete Mathematics.

Liu, C. L. (1986). Elements of discrete mathematics. Tata McGraw-Hill Education.

Ore, O. (1974). Theory of graphs. American mathematical Society.

Roman, S. (1986). An introduction to discrete mathematics. CBS College publishing.

Page 2 of 2

You might also like