Discrete Mathematics (MCA-104)
Program: Master of Computer Applications
Category: Professional Core Course
Semester: 1
Credits: 4
L-T-P: 4- 0- 0
Description
Discrete Mathematics is the branch of mathematics that deals with distinct, countable structures, rather than continuous ones. It covers topics such as logic, set theory, combinatorics, graph theory, and number theory. Discrete math is foundational for computer science, particularly in algorithms, data structures, and cryptography. It provides tools for analyzing discrete objects and systems in a precise and logical manner. The subject is essential for problem-solving in areas like programming, artificial intelligence, and network theory.
Instructor

Dr. Sooraj Singh*

Assistant Professor
Department Of Applied Sciences
Course Outcomes
  • Explain problems using recurrence relations
  • Analyze the role of Relations and Functions in computer science
  • Model problems in Computer Science using graphs and trees
  • Describe basic terminology of mathematical logic to solve a variety of problems
  • Model problems in Computer Science using, trees and Graph coloring
Resources
Course Handout Lesson Plan Syllabus
Evaluation Scheme
MST 20
Assignment 10
Attendance 10
Total Internal 40
Total External 60
Overall Total 100