Course Description

This course introduces and studies (with an emphasis on problem solving) three of the main areas of discrete
mathematics which provide important knowledge and skills for the applied scientist. These areas are: logic;
graphs and trees; and algebraic structures with applications to languages and coding. The subject demonstrates
the importance of these discrete mathematical topics for applied science.

Objectives/Learning Outcomes/Capability Development

On successful completion of this course, you will be able to

Understand the theory and techniques of logic, graphs and trees, and algebraic systems
Apply the knowledge and skills obtained to investigate and solve a variety of discrete mathematical
problems
Communicate mathematical ideas
Make effective use of appropriate technology.

This course contributes to the development of the following Program Learning Outcomes:
Knowledge and technical competence

the ability to use the appropriate and relevant, fundamental and applied mathematical and statistical
knowledge, methodologies and modern computational tools.

Problem-solving

the ability to bring together and flexibly apply knowledge to characterise, analyse and solve a wide
range of problems
an understanding of the balance between the complexity / accuracy of the mathematical / statistical
models used and the timeliness of the delivery of the solution.

Overview of Learning Activities

You will attend lectures where the underlying theory will be presented. A weekly practice class will reinforce
the material covered in lectures and in your personal study. The practice class is designed to assist
understanding and to provide two-way feedback. Shortcomings in your basic skills, e.g. in algebra, will be
revealed and the your capacity to solve problems and to think critically and analytically will be addressed in
each practice class by a challenging problem or problems. Although the work submitted at the end of each

practice class must be individual (copying is forbidden), you are encouraged to discuss the problems with
others and to seek help from, and interact with, the practice class tutors.
You will also have access to the WebLearn system of on-line practice tests, known as WebLearn quizzes. The
aim of the WebLearn quizzes is to enhance your personal study by providing a self-help resource with instant
feedback.
From Blackboard you can also access the online lectures by clicking on the relevant hot links. These lectures
provide extra examples and alternative explanations for the material presented in the face-to-face lectures.

Overview of Learning Resources

You will have access to in-class lecture notes, online lecture notes, and self-assessment quizzes. Practice classes
will be held, where you will be able to discuss your work with tutors and get feedback on your understanding of
the course material.

Overview of Assessment
The assessment is based on a combination of online tests and tests conducted in practice classes, and a final
examination.

Course Objectives
1. To assimilate discrete mathematical concepts.
2. Introducing discrete maths as basic foundation of analysis and applications like communication,

Course Outcomes
1. Ability to reason logically.
2. Ability to understand use of functions, graphs and trees in programming applications.
3. Understand use of groups and codes in Encoding-Decoding.
4. Express recursive functions of other subjects like Data Structures as recurrence relation.
---------------Discrete Structures
Course code: CS 121
Course Name: Discrete Structures
Credit Hours: 3
Course Structure: Lectures: 3 / Labs: 0
Prerequisites: None
Objectives:
Introduces the foundations of discrete mathematics as they apply to Computer Science, focusing on providing a
solid theoretical foundation for further work. Further, this course aims to develop understanding and
appreciation of the finite nature inherent in most Computer Science problems and structures through study of
combinatorial reasoning, abstract algebra, iterative procedures, predicate calculus, tree and graph structures. In
this course more emphasis shall be given to statistical and probabilistic formulation with respect to computing
aspects.
Course Outline:
Introduction to logic and proofs: Direct proofs; proof by contradiction, Sets, Combinatorics, Sequences, Formal
logic, Prepositional and predicate calculus, Methods of Proof, Mathematical Induction and Recursion, loop
invariants, Relations and functions, Pigeonwhole principle, Trees and Graphs, Elementary number theory,
Optimization and matching. Fundamental structures: Functions; relations (more specifically recursions);
pigeonhole principle; cardinality and countability, probabilistic methods.
Reference Material:
Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6TH edition, 2006, Mcgraw Hill Book Co.
Richard Johnsonbaugh, Discrete Mathematics, 7TH edition, 2008, Prentice Hall Publishers.
Kolman, Busby & Ross, Discrete Mathematical Structures, 4th edition, 2000, Prentice-Hall Publishers.
Ralph P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, Addison-Wesley Pub.
Co., 1985.

MIT open courseware

Course Description
This course covers elementary discrete mathematics for computer science and engineering. It emphasizes
mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof
methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic
notation and growth of functions; permutations and combinations, counting principles; discrete probability.
Further selected topics may also be covered, such as recursive definition and structural induction; state
machines and invariants; recurrences; generating functions.
100332 Discrete Mathematics
Instructors: Dr. Immanuel Stampfli
Type: Lecture
Org-unit:
Course Name Abbreviation: DiscMath
Credits: 7.50
Min. | Max. participants: - | Partial Grades:
Final Exam (40%)
Home Work (30%)
Midterm Exam (30%)
Official Course Description:
This course is open to anyone with interest and some experience in mathematics
(for others, General Mathematics and Computational Science I and/or General Mathematics
and Computational Science II is recommended).
Discrete mathematics is a branch of mathematics that deals with discrete objects and has
naturally many applications to computer science. This course introduces the basics of the
subject, in particular (enumerative) combinatorics, graph theory, as well as mathematical logic.
Enumerative combinatorics includes the binomial and multinomial coefficients, the pigeonhole
principle, the inclusion-exclusion formula, generating functions, partitions, and Young
diagrams.
Fundamental topics in graph theory include trees (spanning trees, enumeration of trees),
cycles (Eulerian and Hamiltonian cycles), planar graphs (Kuratowskis theorem), colorings,
and matching (perfect matchings, Halls theorem).
In mathematical logic, among the basic topics are the Zermelo-Fraenkel axioms, as well as
cardinal and ordinal numbers and their properties.
Additional topics may be chosen depending on interests of instructor and students.

Course Description : This is a course at the beginning graduate level to help the students gain basic knowledge
of the structure of graphs and the techniques used to analyze problems in graph theory and discrete structures.
The course will cover fundamental concepts such as graphs, cycle, path, circuit, trees, matchings and factors,
connectivuties and coloring, network. We will also introduce topics in currently active research areas, including
Ramsey theory, extremal combinatorics, algebraic graph theory, combinatorial optimation, and probabistic
methods. Time allows, we will also give an introduction to matroids.