0% found this document useful (0 votes)
5 views

Discrete Mathematics (1)

The document outlines the syllabus for the Discrete Mathematics module (MAT 32103) for the BSc. Degree in Education at Lilongwe University of Science and Natural Resources, Bunda College. It details the course structure, including duration, delivery methods, learning outcomes, and topics of study, which cover relations, combinatorics, number theory, and graph theory. The assessment is weighted 60% for examinations and 40% for continuous assessment, with prescribed and recommended texts provided for further reading.

Uploaded by

praisezaoneka
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views

Discrete Mathematics (1)

The document outlines the syllabus for the Discrete Mathematics module (MAT 32103) for the BSc. Degree in Education at Lilongwe University of Science and Natural Resources, Bunda College. It details the course structure, including duration, delivery methods, learning outcomes, and topics of study, which cover relations, combinatorics, number theory, and graph theory. The assessment is weighted 60% for examinations and 40% for continuous assessment, with prescribed and recommended texts provided for further reading.

Uploaded by

praisezaoneka
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

LILONGWE UNIVERSITY OF SCIENCE AND NATURAL RESOURCES

BUNDA COLLEGE
BASIC SCIENCES DEPARTMENT
SYLLABUS

1. PROGRAMME: BSc. Degree in Education

2. PRESENTED TO: Senate

3. PRESENTED BY : Faculty of Agriculture

4. SUBJECT: Mathematics

5. YEAR/LEVEL OF STUDY: Two

6. MODULE TITLE: Discrete Mathematics

7. COURSE CODE : MAT 32103

8. DURATION : 15 weeks

9. LECTURES HOURS PER WEEK: Three

10. TUTORIAL HOURS PER WEEK : One

11. PRACTICAL HOURS PER WEEK: None

12. STUDENT INDEPENDENT LEARNING HOURS PER WEEK : 9

13. TOTAL MODULE CREDITS :

14. PREREQUISITE MODULES : MAT 33101, MAT 33201

15. COREQUISITE MODULE : None

16. DELIVERY METHODS

16.1 Mode of Delivery : Both Face to face and ODL

1
16.2 Teaching methods : lectures, seminars, tutorials

16.3 Assessment weighting : 60% Examination and 40% Continuous

17. AIM(S) OF THE COURSE

To equip students with analytical skills in discrete mathematics that will enable them to state and
prove some important results in mathematics.

18. LEARNING OUTCOMES

By the end of this course students should be able to:

a) Prove mathematical arguments about functions


b) Solve problems in elementary combinatorics
c) Work out problems in elementary number theory
d) Solve problems concerning essential concepts in graph theory and related algorithms
e) Apply knowledge about discrete mathematics in problem solving

19. TOPICS OF STUDY

a) Relations and Functions


i. Cartesian product
ii. Equivalence relations, equivalence classes, partitions, partial order relations, total order
relations
iii. Function as an example of a relation (domain, range, co-domain)
iv. Theorems on composition and inverse of a function

b) Combinatorics
i. Pigeonhole principle
ii. Fundamental Theorem of Counting (FTC)
iii. Permutations
iv. Combinations
v. The Binomial Theorem

c) Elementary Number Theory


i. Divisibility of Integers
ii. Greatest Common Divisor (GCD) and the Euclidean Algorithm
iii. Fundamental Theorem of Arithmetic (FTA)
iv. Prime Numbers: prime power factorizations, distribution of primes
v. Modular Arithmetic (congruencies and equivalence classes)

d) Elementary Graph Theory


i. Graphs, paths and circuits
ii. Directed and undirected graphs
iii. Trees

2
20. PRESCRIBED TEXTS

i. Diestel R. (2000). Graph Theory. New York. Springer-Verlag

ii.O’Regan G. (2016). Guide to Discrete Mathematics: An accessible introduction to the History, Theory,
Logic and Applications. Switzerland. Springer

21. RECOMMENDED TEXTS/READINGS

i. Lipschutz. S. and Lipson. M. (2007). Discrete Mathematics. New York. McGraw-Hill.

ii. Jones G. A and Jones J. M. (1998). Elementary Number Theory. Lonon. Springer-Verlag

This course /module specification was approved by Senate on ………………………………

You might also like