Discrete Mathematics Syllabus - BCA (TU)
View and download full syllabus of Discrete Mathematics
Course Description
Course Description
Discrete Mathematics (CAMT152) is a core credit course structured under the official university academic syllabus for Bachelor of Computer Application.
Objective
The objective of this course is to introduce the basic principles, techniques, and applications of Discrete Mathematics. Upon the completion students will be able to:
- Equip students with deep theoretical foundations in Discrete Mathematics.
- Develop practical problem-solving, laboratory, and implementation skills.
- Prepare graduates for industry careers, research, and national university examinations.
Learning Outcomes
- Demonstrate rigorous technical knowledge and conceptual mastery of Discrete Mathematics.
- Design, implement, and analyze efficient algorithms and practical frameworks.
- Solve representative theoretical proofs and complex applied problems independently.
Unit Contents
Course Contents
Unit 1: Propositional and Predicate Logic[10 Hrs.]
Unit 1:Comprehensive study notes, key principles, and examples for Propositional and Predicate Logic.
Unit 2: Sets, Relations and Functions[10 Hrs.]
Unit 2:Comprehensive study notes, key principles, and examples for Sets, Relations and Functions.
Unit 3: Graph Theory and Trees[10 Hrs.]
Unit 3:Comprehensive study notes, key principles, and examples for Graph Theory and Trees.
Teaching Method
Classroom lectures (3 hours/week), practical laboratory assignments (3 hours/week), and project work.
Evaluation Scheme
Internal Assessment (40 Marks: Theory Exam, Practical Exam, Attendance, Assignments) and Final University Board Examination (60 Marks).
Reference Books
- Discrete Mathematics and Its Applications by Kenneth H. Rosen (McGraw Hill)
- Discrete Mathematical Structures by Kolman, Busby, Ross
Official Syllabus Source:View official university document