Scribd
Upload
29 views3 pages

Discrete $ Combinatorics Course Outline For CS

The document outlines the course structure for Discrete Mathematics and Combinatorics at Jimma University, detailing the course description, objectives, and content. It covers topics such as logic, counting principles, probability theory, recurrence relations, and graph theory. Assessment methods include assignments, a mid-semester exam, and a final exam, with specified teaching materials and textbooks.

Uploaded by

nahoma010
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
29 views3 pages

Discrete $ Combinatorics Course Outline For CS

The document outlines the course structure for Discrete Mathematics and Combinatorics at Jimma University, detailing the course description, objectives, and content. It covers topics such as logic, counting principles, probability theory, recurrence relations, and graph theory. Assessment methods include assignments, a mid-semester exam, and a final exam, with specified teaching materials and textbooks.

Uploaded by

nahoma010
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/ 3

Jimma University

College of Natural Sciences

Department of Mathematics
Discrete Mathematics and Combinatorics Course Outline
Program: Computer Science Course title: Discrete Mathematics and Combinatorics
Course code: Math 2052 Credit hours: 3 ECTS:5 Contact hrs: 3 Tutorial hrs: 2
Prerequisite: None Course category: Supportive
Year: II Semester: II
Course description:
This course deals with review of mathematics 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 concept of logic and mathematical proof
➢ know basic concepts of discrete mathematics,
➢ understand the principles of counting, recurrence relations and generating functions,
➢ 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 Contents:
Chapter 1: Introduction to logic and mathematical proof (6hr)
1.1 Introduction to logic and statement
1.2 Propositional and predicate logic
1.3 Methods of proof
1.4 Elementary number properties
Chapter 2: Elementary counting principles (8 hrs)
2.1 Basic counting principle
2.2 Permutations and combinations
2.3 The inclusion-exclusion principles
2.4 The pigeonhole principle
2.5 The binomial theorem
Chapter 3: Elementary probability theory (7 hrs)
3.1 Sample space and events
3.2 Probability of an event
3.3 Conditional probability
3.4 Independent events
3.5 Random variables and expectation
Chapter 4: Recurrence relations (7 hrs)
4.1 Definition and examples
4.2 Linear recurrence relations with constant coefficient
4.3 Solutions of linear recurrence relations
4.4 Solutions of homogeneous and non - homogeneous recurrence relations
Chapter 5: Elements of graph theory (7 hrs)
5.1 Definition and examples of a graph
5.2 Matrix representation of a graph
5.3 Isomorphic graphs
5.4 Path and connectivity of a graph
5.5 Complete, regular and bipartite graphs
5.6 Eulerian and Hamiltonian graphs
5.7 Trees and forests (Rooted and Binary trees)
5.8 Planar graphs
5.9 Graph coloring
Chapter 6: Directed graphs (6 hrs)
6.1 Definition and examples of digraphs
6.2 Matrix representation of digraphs
6.3 Paths and connectivity
Chapter 7: Weighted graphs and their applications (7 hrs)
7.1 Weighted Graphs
7.2 Minimal Spanning trees
7.3 Shortest path problem
7.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
Text Books:
➢ 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:
➢ Ensley, Douglas E.and J. WinstonCrawley,Discrete Mathematics: Mathematical
Reasoning and Proof with Puzzles, Patterns, and Games, Wiley, 2005.
➢ 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.

You might also like