Scribd
Upload
25 views3 pages

MAT1008 - Discrete Mathematics Syllabus Outline 2024

The syllabus outlines the Discrete Mathematics module (MAT 1008) for Year 1 students at the University of Technology, Jamaica, covering 39 hours of instruction with a credit value of 3. The course includes topics such as logic, number systems, recurrence relations, algorithms, counting principles, and applications, with assessments comprising two tests and a final exam. Required and recommended textbooks are provided, along with additional online resources for further learning.

Uploaded by

scoptic
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
25 views3 pages

MAT1008 - Discrete Mathematics Syllabus Outline 2024

The syllabus outlines the Discrete Mathematics module (MAT 1008) for Year 1 students at the University of Technology, Jamaica, covering 39 hours of instruction with a credit value of 3. The course includes topics such as logic, number systems, recurrence relations, algorithms, counting principles, and applications, with assessments comprising two tests and a final exam. Required and recommended textbooks are provided, along with additional online resources for further learning.

Uploaded by

scoptic
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

UNIVERSITY OF TECHNOLOGY, JAMAICA

SYLLABUS OUTLINE SEM 1 2024/5

COLLEGE/FACULTY: Science and Sport

SCHOOL: Mathematics and Statistics

COURSE OF STUDY: BSc Science & Education, BSc Computer Science, BSc Actuarial

Science, BSc Mathematics & Education

MODULE TITLE: Discrete Mathematics

LEVEL: Year 1

MODULE CODE: MAT 1008

DURATION (Credit Hours): 39 hours (3 hours theory per week)

CREDIT VALUE: 3

PREREQUISITES: College Mathematics 1A (MAT1044) or


College Mathematics 1B (MAT1047)

LECTURERS: Xhano Soares (xsoares@utech.edu.jm, (876) 406 7956)


Stacey Franklin (Stacey.Peart@uteech.edu.jm)

1.0 MODULE DESCRIPTION

This module provides students with an introduction to the logical foundations upon which
much of modern computer science rests. It also introduces students to the practical
applications of the theoretical principles of discrete mathematics. Finally, it addresses
understanding, doing proofs and generally expanding mathematical maturity.

2.0 MODULE CONTENT AND CONTEXT

UNIT 1 Logic and Proof (11 Hours)

1.1 Propositions and truth tables


1.2 Logical equivalence
1.3 Quantifiers
1.4 Arguments
1.5 Methods of proof – direct, indirect, contradiction and mathematical induction

1
UNIT 2 Number Systems and Relations (4 Hours)

2.1 Number systems


2.2 Relations
2.3 Equivalence relations

UNIT 3 Recurrence Relations (8 Hours)

3.1 Recurrence relations


3.2 Solving first order recurrence relations
3.3 Solving second order linear homogeneous recurrence relations
with constant coefficients

UNIT 4 Algorithms (6 Hours)

4.1 Complexity of algorithms


4.2 The Euclidean algorithm

UNIT 5 Counting Principles (4 Hours)

5.1 The Multiplication and Addition principles


5.2 Permutations
5.3 Combinations

UNIT 6 Applications (6 Hours)

6.1 Combinatorial circuits


6.2 Boolean expressions and functions

3.0 ASSESSMENT PROCEDURES

Course Work:

Test#1 25% - Written questions on UNIT 1

Test#2 25% - Written questions on UNITS 2 & 3

Final Examination 50% - Written questions on all units

(All assessment pieces are F2F)

2
4.0 BREAKDOWN OF HOURS

o Classroom lecture/tutorials – 37 hours


o Assessment – 4 hours

5.0 TEXTBOOKS AND REFERENCES

Required – Johnsonbaugh, R. (2017), Discrete Mathematics, 8th Edition, Upper Saddle


River,NJ: Pearson Prentice Hall.

Recommended –
1. Rosen, K. (2019), Discrete Mathematics and Applications, 8th Edition, New York,
NY: McGraw-Hill.
2. Epp, S. (2019), Discrete Mathematics with Applications, 5th Edition, Cengage
Learning.

Additional Reading/websites/learning resources –


1. https://math.libretexts.org/Courses/Prince_Georges_Community_College/MAT_1130
_Mathematical_Ideas_Mirtova_Jones_(PGCC%3A_Fall_2022)/02%3A_Logic/2.02%
3A_Introduction_to_Truth_Tables
2. https://www.youtube.com/watch?v=F3544ZyO-eU
3. https://www.youtube.com/watch?v=TCBu8PD4Lls
4. https://www.youtube.com/watch?v=93CxSLi89Ok
5. https://www.youtube.com/watch?v=tHNVX3e9zd0
6. https://www.youtube.com/watch?v=tSLKOKGQq0Y&t=36s
7. https://www.youtube.com/watch?v=FI6j5QZNVx0
8. https://www.youtube.com/watch?v=7mhvA5L7KqY
9. https://www.youtube.com/watch?v=1CTzx89Kzy4
10. https://www.mathsisfun.com/combinatorics/combinations-permutations.html
11. https://www.youtube.com/playlist?list=PLvPAKqQgBK1NeA1Tk1a2XVthPLaSMg
UkX

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy