Scribd
Upload
16 views1 page

MAT212 or STA211 Syllabus

The document outlines the BSc and BEd module MAT212/STA211 in Discrete Mathematics at Chancellor College, University of Malawi. It includes details on the module's aim, objectives, topics of study, assessment methods, and prescribed and recommended texts. The course focuses on essential mathematical skills applicable in information technology, biological sciences, and statistical sciences.

Uploaded by

futurepilot2
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
16 views1 page

MAT212 or STA211 Syllabus

The document outlines the BSc and BEd module MAT212/STA211 in Discrete Mathematics at Chancellor College, University of Malawi. It includes details on the module's aim, objectives, topics of study, assessment methods, and prescribed and recommended texts. The course focuses on essential mathematical skills applicable in information technology, biological sciences, and statistical sciences.

Uploaded by

futurepilot2
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/ 1

Un iv e rsit y o f M a law i

CHANCELLOR COLLEGE

1. Programme: BSc, BEd.


2. Module Code: MAT212/STA211
3. Module Title: Discrete Mathematics.
4. Year: Two.
5. Presented to: Faculty of Science / Senate.
6. Presented by: Department of Mathematical Sciences / Faculty of Science.
7. Number of Lectures per Week: 3 (for one Semester).
8. Number of Tutorials per Week: 1 (for one Semester).
9. Method of Assessment: Continuous Assessment 40%, Final Examination 60%.
10. Aim of Module:
To provide students with basic knowledge of discrete and combinatorial mathematical skills necessary for
information technology, biological sciences and statistical sciences.

11. Objectives of Module:


Students should be able to:
a) use counting techniques to solve counting problems;
b) apply the pigeon-hole principle to solve existence problems;
c) prove or apply graph theory ideas and relate them to real life problems;
d) set, solve and apply difference equations;
e) relate and apply coding theory principles to information technology and experimental designs.

12. Topics of Study:


i) Counting techniques: the product rule, the sum rule, combinations and permutations, inclusion and
exclusion principle, multinomial theorem, generating functions.
ii) Pigeon-hole principle: simplest form, regular form, generalized form.
iii) Graph theory: valency/degree, paths/chains, cycles, vertex colouring and time tabling, spanning and
search trees, allocation problem and networks.
iv) Difference equations: iteration, root method, generating functions, formulation of relations
v) Coding theory: coding, decoding, error correction codes and experimental design

13. Prescribed Texts:


Roberts, F.S., Applied Combinatorics, Prentice-Hall, Inc.: New Jersey, 1984.
Rosen, K. H. Discrete Mathematics and its Applications, McGraw-Hill Co: New York (electronic)

14. Recommended Texts:


Liu, C.L., Introduction to Combinatorial Mathematics, McGraw-Hill Book Company: New York, 1968.
Anderson, I., A First Course in Combinatorial Mathematics, Clarendon Press: Oxford, 1974.
Beckenbach, E.F., Applied Combinatorial Mathematics, Robert E. Kruger Publishing Company: Florida, 1981.

You might also like