Discrete mathematics is the study of mathematical structures that are fundamentally discrete such as predicates, integers, relations, graphs, etc. The development of digital computers has motivated the development of discrete mathematics and the concepts and notations from discrete mathematics are useful in studying and describing objects and problems in branches of computer science, such as computer algorithms, programming languages, compiler design, cryptography, automated theorem proving, and software development.
Announcements / Assessments
May 2021 Semester:
-
Tutorial starts from Week 2
-
Quiz: Week 5 (tentative)
-
Covering Slide 1 (Propositional Logic and Predicate Logic)
-
One hour
-
20 Marks.
-
-
Test: Week 10 (tentative)
-
Covering Topics 2 and 3
-
One Hour
-
20 Marks
-
-
Assignment: Week 10
-
Covering Topics 4
-
Deadline: Week 13
-
20 Marks
-
-
Final Assessment (Online Exam)
-
Covering Topics 1 to 4
-
40 Marks
-
Date and Time: To be announced by University
-
Lecture Notes
Note that both Topic 1 and Topic 2 are merged into one slide containing two parts (Part 1: Propositional Logic and Part 2: Predicate Logic)
-
Topic 1: Semantics of Propositional Logic and First Order Predicate Logics
-
Electronics engineers have a technique called Karnaugh map (watch https://www.youtube.com/results?search_query=karnaugh) for finding the minimal logically equivalent passive circuit (which is logically equivalent to a proposition).
-
-
Topic 2: Simple Proof Theory for Propositional Logic and First Order Predicate Logic
Tutorials
References
-
Epp, S. S., 2020. Discrete Mathematics with Applications. 5th ed. Boston, MA: Brooks/Cole Cengage Learning.
-
Rosen, K. H., 2019. Discrete Mathematics and its Applications. 8th ed. New York: McGraw-Hill.
-
Scheinerman, E. R., 2013. Mathematics --- A Discrete Introduction. 3rd ed. Boston, Mass.: Brooks/Cole.